<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.6"/>
<title>TP1-Algo: Référence de la classe TP1::Labyrinthe</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
  $(window).load(resizeHeight);
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">TP1-Algo
   &#160;<span id="projectnumber">1.0</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Généré par Doxygen 1.8.6 -->
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Page&#160;principale</span></a></li>
      <li><a href="namespaces.html"><span>Espaces&#160;de&#160;nommage</span></a></li>
      <li class="current"><a href="annotated.html"><span>Classes</span></a></li>
      <li><a href="files.html"><span>Fichiers</span></a></li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="annotated.html"><span>Liste&#160;des&#160;classes</span></a></li>
      <li><a href="functions.html"><span>Membres&#160;de&#160;classe</span></a></li>
    </ul>
  </div>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
      <div id="nav-sync" class="sync"></div>
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('class_t_p1_1_1_labyrinthe.html','');});
</script>
<div id="doc-content">
<div class="header">
  <div class="summary">
<a href="#nested-classes">Classes</a> &#124;
<a href="#pub-methods">Fonctions membres publiques</a> &#124;
<a href="#pri-methods">Fonctions membres privées</a> &#124;
<a href="#pri-attribs">Attributs privés</a> &#124;
<a href="class_t_p1_1_1_labyrinthe-members.html">Liste de tous les membres</a>  </div>
  <div class="headertitle">
<div class="title">Référence de la classe TP1::Labyrinthe</div>  </div>
</div><!--header-->
<div class="contents">

<p><code>#include &lt;<a class="el" href="_labyrinthe_8h_source.html">Labyrinthe.h</a>&gt;</code></p>
<div class="dynheader">
Graphe de collaboration de TP1::Labyrinthe:</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe__coll__graph.png" border="0" usemap="#_t_p1_1_1_labyrinthe_coll__map" alt="Collaboration graph"/></div>
<map name="_t_p1_1_1_labyrinthe_coll__map" id="_t_p1_1_1_labyrinthe_coll__map">
</map>
<center><span class="legend">[<a target="top" href="graph_legend.html">légende</a>]</span></center></div>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="nested-classes"></a>
Classes</h2></td></tr>
<tr class="memitem:"><td class="memItemLeft" align="right" valign="top">class &#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html">NoeudListePieces</a></td></tr>
<tr class="memdesc:"><td class="mdescLeft">&#160;</td><td class="mdescRight">Noeud comprenant une pièce et un pointeur sur la pièce suivante.  <a href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#details">Plus de détails...</a><br/></td></tr>
<tr class="separator:"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pub-methods"></a>
Fonctions membres publiques</h2></td></tr>
<tr class="memitem:a81f1cf775efc5f50a6149473c0696624"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a81f1cf775efc5f50a6149473c0696624">Labyrinthe</a> ()</td></tr>
<tr class="memdesc:a81f1cf775efc5f50a6149473c0696624"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructeur par défaut de la classe <a class="el" href="class_t_p1_1_1_labyrinthe.html">Labyrinthe</a>, un labyrinthe sans pièce est créé  <a href="#a81f1cf775efc5f50a6149473c0696624">Plus de détails...</a><br/></td></tr>
<tr class="separator:a81f1cf775efc5f50a6149473c0696624"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:af9a1aafe089fcb0ba65fa65eb0d1811d"><td class="memItemLeft" align="right" valign="top">virtual&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#af9a1aafe089fcb0ba65fa65eb0d1811d">~Labyrinthe</a> ()</td></tr>
<tr class="memdesc:af9a1aafe089fcb0ba65fa65eb0d1811d"><td class="mdescLeft">&#160;</td><td class="mdescRight">destructeur de la classe <a class="el" href="class_t_p1_1_1_labyrinthe.html">Labyrinthe</a>, détruit proprement l'objet  <a href="#af9a1aafe089fcb0ba65fa65eb0d1811d">Plus de détails...</a><br/></td></tr>
<tr class="separator:af9a1aafe089fcb0ba65fa65eb0d1811d"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ade287070f8001050e56bd714d30d0198"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#ade287070f8001050e56bd714d30d0198">Labyrinthe</a> (const <a class="el" href="class_t_p1_1_1_labyrinthe.html">Labyrinthe</a> &amp;)</td></tr>
<tr class="memdesc:ade287070f8001050e56bd714d30d0198"><td class="mdescLeft">&#160;</td><td class="mdescRight">constructeur de copie de la classe labyrinthe, fait une copie profonde du labyrinthe passé en argument  <a href="#ade287070f8001050e56bd714d30d0198">Plus de détails...</a><br/></td></tr>
<tr class="separator:ade287070f8001050e56bd714d30d0198"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a1ad0c84b6d7f383a9d65d397d38bcb56"><td class="memItemLeft" align="right" valign="top">const <a class="el" href="class_t_p1_1_1_labyrinthe.html">Labyrinthe</a> &amp;&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a1ad0c84b6d7f383a9d65d397d38bcb56">operator=</a> (const <a class="el" href="class_t_p1_1_1_labyrinthe.html">Labyrinthe</a> &amp;source)</td></tr>
<tr class="memdesc:a1ad0c84b6d7f383a9d65d397d38bcb56"><td class="mdescLeft">&#160;</td><td class="mdescRight">surcharge de l'opérateur d'assignation, fait une copie profonde du labyrinthe passé en argument dans l'objet courant  <a href="#a1ad0c84b6d7f383a9d65d397d38bcb56">Plus de détails...</a><br/></td></tr>
<tr class="separator:a1ad0c84b6d7f383a9d65d397d38bcb56"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a854dc263c65a447286038fde7843ec41"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a854dc263c65a447286038fde7843ec41">chargeLabyrinthe</a> (<a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a> couleur, std::ifstream &amp;entree)</td></tr>
<tr class="memdesc:a854dc263c65a447286038fde7843ec41"><td class="mdescLeft">&#160;</td><td class="mdescRight">méthode permettant de charger un fichier contenant un labyrinthe d'une certaine couleur  <a href="#a854dc263c65a447286038fde7843ec41">Plus de détails...</a><br/></td></tr>
<tr class="separator:a854dc263c65a447286038fde7843ec41"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7297e9340033b8402836ced30e5c96e0"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a7297e9340033b8402836ced30e5c96e0">ajoutePieceLabyrinthe</a> (<a class="el" href="class_t_p1_1_1_piece.html">Piece</a> &amp;p)</td></tr>
<tr class="memdesc:a7297e9340033b8402836ced30e5c96e0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Permet d'ajouter une pièce au labyrinthe.  <a href="#a7297e9340033b8402836ced30e5c96e0">Plus de détails...</a><br/></td></tr>
<tr class="separator:a7297e9340033b8402836ced30e5c96e0"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aaf2181692e1946ce3c42242acb34bcbe"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#aaf2181692e1946ce3c42242acb34bcbe">solutionner</a> (<a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a> joueur)</td></tr>
<tr class="memdesc:aaf2181692e1946ce3c42242acb34bcbe"><td class="mdescLeft">&#160;</td><td class="mdescRight">trouve le nombre d'étapes minimales à franchir pour partir de la case départ et arriver à la case arrivée pour un joueur  <a href="#aaf2181692e1946ce3c42242acb34bcbe">Plus de détails...</a><br/></td></tr>
<tr class="separator:aaf2181692e1946ce3c42242acb34bcbe"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a0c496d235d32655572107f1ea18b8978"><td class="memItemLeft" align="right" valign="top"><a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a0c496d235d32655572107f1ea18b8978">trouveGagnant</a> ()</td></tr>
<tr class="memdesc:a0c496d235d32655572107f1ea18b8978"><td class="mdescLeft">&#160;</td><td class="mdescRight">Méthode permettant de trouver la couleur qui résout le labyrinthe le plus rapidement.  <a href="#a0c496d235d32655572107f1ea18b8978">Plus de détails...</a><br/></td></tr>
<tr class="separator:a0c496d235d32655572107f1ea18b8978"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac6e2db78398a84ccf495e318df7643d0"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_t_p1_1_1_chemin.html">Chemin</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#ac6e2db78398a84ccf495e318df7643d0">cheminLabyrinthe</a> (<a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a> joueur)</td></tr>
<tr class="memdesc:ac6e2db78398a84ccf495e318df7643d0"><td class="mdescLeft">&#160;</td><td class="mdescRight">Méthode permettant de trouver un chemin pour solutionner le labyrinthe pour une couleur donnée.  <a href="#ac6e2db78398a84ccf495e318df7643d0">Plus de détails...</a><br/></td></tr>
<tr class="separator:ac6e2db78398a84ccf495e318df7643d0"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-methods"></a>
Fonctions membres privées</h2></td></tr>
<tr class="memitem:a4b4d2f9b7dc1c3572e720269b9bdad0b"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a4b4d2f9b7dc1c3572e720269b9bdad0b">ajoutePassage</a> (<a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a> couleur, int i1, int j1, int i2, int j2)</td></tr>
<tr class="memdesc:a4b4d2f9b7dc1c3572e720269b9bdad0b"><td class="mdescLeft">&#160;</td><td class="mdescRight">méthode privée qui ajoute un passage dans un labyrinthe  <a href="#a4b4d2f9b7dc1c3572e720269b9bdad0b">Plus de détails...</a><br/></td></tr>
<tr class="separator:a4b4d2f9b7dc1c3572e720269b9bdad0b"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a4d0e2a073458a8c1aadf99a394f10929"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a4d0e2a073458a8c1aadf99a394f10929">placeDepart</a> (std::string &amp;nom)</td></tr>
<tr class="memdesc:a4d0e2a073458a8c1aadf99a394f10929"><td class="mdescLeft">&#160;</td><td class="mdescRight">Méthode qui ajuste le pointeur depart pour qu'il pointe sur la pièce qui à le nom passé en argument.  <a href="#a4d0e2a073458a8c1aadf99a394f10929">Plus de détails...</a><br/></td></tr>
<tr class="separator:a4d0e2a073458a8c1aadf99a394f10929"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8cfe9f921d848b474e1843d1779753d7"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a8cfe9f921d848b474e1843d1779753d7">placeArrivee</a> (std::string &amp;nom)</td></tr>
<tr class="memdesc:a8cfe9f921d848b474e1843d1779753d7"><td class="mdescLeft">&#160;</td><td class="mdescRight">Méthode qui ajuste le pointeur arrivee pour qu'il pointe sur la pièce qui à le nom passé en argument.  <a href="#a8cfe9f921d848b474e1843d1779753d7">Plus de détails...</a><br/></td></tr>
<tr class="separator:a8cfe9f921d848b474e1843d1779753d7"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a8085a344fef40a88f2be737080b8b85c"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html">NoeudListePieces</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">trouvePiece</a> (std::string &amp;nom) const </td></tr>
<tr class="memdesc:a8085a344fef40a88f2be737080b8b85c"><td class="mdescLeft">&#160;</td><td class="mdescRight">Méthode retournant l'adresse du noeud de la liste des pièces ayant le nom fourni en argument.  <a href="#a8085a344fef40a88f2be737080b8b85c">Plus de détails...</a><br/></td></tr>
<tr class="separator:a8085a344fef40a88f2be737080b8b85c"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a32d6b079ac02e24a0cc8f265d00a7259"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a32d6b079ac02e24a0cc8f265d00a7259">_copier</a> (<a class="el" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html">NoeudListePieces</a> *)</td></tr>
<tr class="memdesc:a32d6b079ac02e24a0cc8f265d00a7259"><td class="mdescLeft">&#160;</td><td class="mdescRight">fait une copie d'un labyrinthe à partir du noeud fourni en argument  <a href="#a32d6b079ac02e24a0cc8f265d00a7259">Plus de détails...</a><br/></td></tr>
<tr class="separator:a32d6b079ac02e24a0cc8f265d00a7259"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7ca81e2e69b6c14e8ab95ebc93e73b97"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a7ca81e2e69b6c14e8ab95ebc93e73b97">_detruire</a> ()</td></tr>
<tr class="memdesc:a7ca81e2e69b6c14e8ab95ebc93e73b97"><td class="mdescLeft">&#160;</td><td class="mdescRight">Cette méthode détruit proprement le labyrinthe en libérant la mémoire pour chaque noeud.  <a href="#a7ca81e2e69b6c14e8ab95ebc93e73b97">Plus de détails...</a><br/></td></tr>
<tr class="separator:a7ca81e2e69b6c14e8ab95ebc93e73b97"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ae0b2183346c7bc6d459fbad723ebef90"><td class="memItemLeft" align="right" valign="top">bool&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#ae0b2183346c7bc6d459fbad723ebef90">_trouveChemin</a> (<a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a>, <a class="el" href="class_t_p1_1_1_chemin.html">Chemin</a> &amp;, const <a class="el" href="class_t_p1_1_1_piece.html">Piece</a> &amp;)</td></tr>
<tr class="memdesc:ae0b2183346c7bc6d459fbad723ebef90"><td class="mdescLeft">&#160;</td><td class="mdescRight">Méthode trouvant un chemin pour traverser le labyrinthe pour une couleur donnée.  <a href="#ae0b2183346c7bc6d459fbad723ebef90">Plus de détails...</a><br/></td></tr>
<tr class="separator:ae0b2183346c7bc6d459fbad723ebef90"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a6c7a9bf56089a18a782553c2c3afa161"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_t_p1_1_1_chemin.html">Chemin</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a6c7a9bf56089a18a782553c2c3afa161">_trouvePiecesAccessible</a> (const <a class="el" href="class_t_p1_1_1_piece.html">Piece</a> &amp;, <a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a>) const </td></tr>
<tr class="memdesc:a6c7a9bf56089a18a782553c2c3afa161"><td class="mdescLeft">&#160;</td><td class="mdescRight">Méthode permettant de trouver toutes les pièces accessibles à partir d'une pièce pour une couleur donnée.  <a href="#a6c7a9bf56089a18a782553c2c3afa161">Plus de détails...</a><br/></td></tr>
<tr class="separator:a6c7a9bf56089a18a782553c2c3afa161"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a7e3d3b3164b40651295d0bc49047fa18"><td class="memItemLeft" align="right" valign="top">void&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a7e3d3b3164b40651295d0bc49047fa18">_mettreParcourueAFaux</a> ()</td></tr>
<tr class="memdesc:a7e3d3b3164b40651295d0bc49047fa18"><td class="mdescLeft">&#160;</td><td class="mdescRight">mets l'attribut parcourue à faux pour chaque piece dans le labyrinthe  <a href="#a7e3d3b3164b40651295d0bc49047fa18">Plus de détails...</a><br/></td></tr>
<tr class="separator:a7e3d3b3164b40651295d0bc49047fa18"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a name="pri-attribs"></a>
Attributs privés</h2></td></tr>
<tr class="memitem:a8eb7ef93bae46710cbbc6b07db3e9184"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html">NoeudListePieces</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a></td></tr>
<tr class="separator:a8eb7ef93bae46710cbbc6b07db3e9184"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a41c30a4b682aa2846674740f9ae011ee"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_t_p1_1_1_piece.html">Piece</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">depart</a></td></tr>
<tr class="separator:a41c30a4b682aa2846674740f9ae011ee"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ac426bb3a87931bf212c9b3478d7019d1"><td class="memItemLeft" align="right" valign="top"><a class="el" href="class_t_p1_1_1_piece.html">Piece</a> *&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#ac426bb3a87931bf212c9b3478d7019d1">arrivee</a></td></tr>
<tr class="separator:ac426bb3a87931bf212c9b3478d7019d1"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab9727bd08c01a7b8ed33a4523e22a83e"><td class="memItemLeft" align="right" valign="top">int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a></td></tr>
<tr class="separator:ab9727bd08c01a7b8ed33a4523e22a83e"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Description détaillée</h2>
<div class="textblock">
<p>Définition à la ligne <a class="el" href="_labyrinthe_8h_source.html#l00031">31</a> du fichier <a class="el" href="_labyrinthe_8h_source.html">Labyrinthe.h</a>.</p>
</div><h2 class="groupheader">Documentation des constructeurs et destructeur</h2>
<a class="anchor" id="a81f1cf775efc5f50a6149473c0696624"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">TP1::Labyrinthe::Labyrinthe </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>constructeur par défaut de la classe <a class="el" href="class_t_p1_1_1_labyrinthe.html">Labyrinthe</a>, un labyrinthe sans pièce est créé </p>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00025">25</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>
<div class="fragment"><div class="line"><a name="l00026"></a><span class="lineno">   26</span>&#160;:<a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>(NULL), <a class="code" href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">depart</a>(NULL), <a class="code" href="class_t_p1_1_1_labyrinthe.html#ac426bb3a87931bf212c9b3478d7019d1">arrivee</a>(NULL), <a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a>(0)</div>
<div class="line"><a name="l00027"></a><span class="lineno">   27</span>&#160;{}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a41c30a4b682aa2846674740f9ae011ee"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">TP1::Labyrinthe::depart</a></div><div class="ttdeci">Piece * depart</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00167">Labyrinthe.h:167</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ab9727bd08c01a7b8ed33a4523e22a83e"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">TP1::Labyrinthe::cpt</a></div><div class="ttdeci">int cpt</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00169">Labyrinthe.h:169</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ac426bb3a87931bf212c9b3478d7019d1"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ac426bb3a87931bf212c9b3478d7019d1">TP1::Labyrinthe::arrivee</a></div><div class="ttdeci">Piece * arrivee</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00167">Labyrinthe.h:167</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8eb7ef93bae46710cbbc6b07db3e9184"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">TP1::Labyrinthe::dernier</a></div><div class="ttdeci">NoeudListePieces * dernier</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00165">Labyrinthe.h:165</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a class="anchor" id="af9a1aafe089fcb0ba65fa65eb0d1811d"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">TP1::Labyrinthe::~Labyrinthe </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">virtual</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>destructeur de la classe <a class="el" href="class_t_p1_1_1_labyrinthe.html">Labyrinthe</a>, détruit proprement l'objet </p>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00032">32</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8cpp_source.html#l00365">_detruire()</a>.</p>
<div class="fragment"><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;{</div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a7ca81e2e69b6c14e8ab95ebc93e73b97">_detruire</a>();</div>
<div class="line"><a name="l00035"></a><span class="lineno">   35</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a7ca81e2e69b6c14e8ab95ebc93e73b97"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a7ca81e2e69b6c14e8ab95ebc93e73b97">TP1::Labyrinthe::_detruire</a></div><div class="ttdeci">void _detruire()</div><div class="ttdoc">Cette méthode détruit proprement le labyrinthe en libérant la mémoire pour chaque noeud...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00365">Labyrinthe.cpp:365</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_af9a1aafe089fcb0ba65fa65eb0d1811d_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_af9a1aafe089fcb0ba65fa65eb0d1811d_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_af9a1aafe089fcb0ba65fa65eb0d1811d_cgraph" id="class_t_p1_1_1_labyrinthe_af9a1aafe089fcb0ba65fa65eb0d1811d_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="ade287070f8001050e56bd714d30d0198"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">TP1::Labyrinthe::Labyrinthe </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="class_t_p1_1_1_labyrinthe.html">Labyrinthe</a> &amp;&#160;</td>
          <td class="paramname"><em>l</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>constructeur de copie de la classe labyrinthe, fait une copie profonde du labyrinthe passé en argument </p>
<dl class="section pre"><dt>Précondition</dt><dd>il y a assez de mémoire pour faire la copie</dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
  <table class="exception">
    <tr><td class="paramname">bad_alloc</td><td>s'il n'y a pas assez de mémoire pour faire la copie</td></tr>
  </table>
  </dd>
</dl>
<dl class="params"><dt>Paramètres</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">l,labyrinthe</td><td>qu'on va copier dans l'objet courant </td></tr>
  </table>
  </dd>
</dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00042">42</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8cpp_source.html#l00339">_copier()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00167">arrivee</a>, <a class="el" href="_labyrinthe_8h_source.html#l00169">cpt</a>, <a class="el" href="_labyrinthe_8h_source.html#l00167">depart</a>, <a class="el" href="_labyrinthe_8h_source.html#l00165">dernier</a>, <a class="el" href="_piece_8cpp_source.html#l00070">TP1::Piece::getNom()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00283">placeArrivee()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00260">placeDepart()</a>.</p>
<div class="fragment"><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;:<a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>(NULL), <a class="code" href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">depart</a>(NULL), <a class="code" href="class_t_p1_1_1_labyrinthe.html#ac426bb3a87931bf212c9b3478d7019d1">arrivee</a>(NULL), <a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a>(l.cpt)</div>
<div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;{</div>
<div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;    <span class="comment">// s&#39;il n&#39;y a pas de pièce dans le labyrinthe à copier, on termine la méthode</span></div>
<div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;    <span class="keywordflow">if</span>(<a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a> == 0)</div>
<div class="line"><a name="l00047"></a><span class="lineno">   47</span>&#160;        <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160;    <span class="comment">// sinon, on fait la copie</span></div>
<div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160;    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a32d6b079ac02e24a0cc8f265d00a7259">_copier</a>(l.dernier);</div>
<div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160;    <span class="keywordtype">string</span> nom = l.arrivee-&gt;getNom();</div>
<div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8cfe9f921d848b474e1843d1779753d7">placeArrivee</a>(nom);</div>
<div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;    nom = l.depart-&gt;getNom();</div>
<div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a4d0e2a073458a8c1aadf99a394f10929">placeDepart</a>(nom);</div>
<div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a4d0e2a073458a8c1aadf99a394f10929"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a4d0e2a073458a8c1aadf99a394f10929">TP1::Labyrinthe::placeDepart</a></div><div class="ttdeci">void placeDepart(std::string &amp;nom)</div><div class="ttdoc">Méthode qui ajuste le pointeur depart pour qu&#39;il pointe sur la pièce qui à le nom passé en argument...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00260">Labyrinthe.cpp:260</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a41c30a4b682aa2846674740f9ae011ee"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">TP1::Labyrinthe::depart</a></div><div class="ttdeci">Piece * depart</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00167">Labyrinthe.h:167</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ab9727bd08c01a7b8ed33a4523e22a83e"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">TP1::Labyrinthe::cpt</a></div><div class="ttdeci">int cpt</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00169">Labyrinthe.h:169</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8cfe9f921d848b474e1843d1779753d7"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8cfe9f921d848b474e1843d1779753d7">TP1::Labyrinthe::placeArrivee</a></div><div class="ttdeci">void placeArrivee(std::string &amp;nom)</div><div class="ttdoc">Méthode qui ajuste le pointeur arrivee pour qu&#39;il pointe sur la pièce qui à le nom passé en argument...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00283">Labyrinthe.cpp:283</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a32d6b079ac02e24a0cc8f265d00a7259"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a32d6b079ac02e24a0cc8f265d00a7259">TP1::Labyrinthe::_copier</a></div><div class="ttdeci">void _copier(NoeudListePieces *)</div><div class="ttdoc">fait une copie d&#39;un labyrinthe à partir du noeud fourni en argument </div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00339">Labyrinthe.cpp:339</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ac426bb3a87931bf212c9b3478d7019d1"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ac426bb3a87931bf212c9b3478d7019d1">TP1::Labyrinthe::arrivee</a></div><div class="ttdeci">Piece * arrivee</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00167">Labyrinthe.h:167</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8eb7ef93bae46710cbbc6b07db3e9184"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">TP1::Labyrinthe::dernier</a></div><div class="ttdeci">NoeudListePieces * dernier</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00165">Labyrinthe.h:165</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_ade287070f8001050e56bd714d30d0198_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_ade287070f8001050e56bd714d30d0198_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_ade287070f8001050e56bd714d30d0198_cgraph" id="class_t_p1_1_1_labyrinthe_ade287070f8001050e56bd714d30d0198_cgraph">
</map>
</div>
</p>

</div>
</div>
<h2 class="groupheader">Documentation des fonctions membres</h2>
<a class="anchor" id="a32d6b079ac02e24a0cc8f265d00a7259"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void TP1::Labyrinthe::_copier </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html">NoeudListePieces</a> *&#160;</td>
          <td class="paramname"><em>n</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>fait une copie d'un labyrinthe à partir du noeud fourni en argument </p>
<dl class="section pre"><dt>Précondition</dt><dd>il y a assez d'espace pour faire la copie </dd>
<dd>
le noeud donné pointe sur le dernier élément du labyrinthe à copier </dd></dl>
<dl class="section post"><dt>Postcondition</dt><dd>une copie profonde sera fait à partir du noeud</dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
  <table class="exception">
    <tr><td class="paramname">bad_alloc</td><td>s'il n'y a pas assez de mémoire</td></tr>
  </table>
  </dd>
</dl>
<dl class="params"><dt>Paramètres</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">n,noeud</td><td>à partir duquel on fait une copie </td></tr>
  </table>
  </dd>
</dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00339">339</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8cpp_source.html#l00365">_detruire()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00165">dernier</a>, <a class="el" href="_labyrinthe_8h_source.html#l00145">TP1::Labyrinthe::NoeudListePieces::piece</a>, et <a class="el" href="_labyrinthe_8h_source.html#l00147">TP1::Labyrinthe::NoeudListePieces::suivant</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00042">Labyrinthe()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00056">operator=()</a>.</p>
<div class="fragment"><div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;{</div>
<div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;    <span class="keywordflow">try</span> {</div>
<div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;        <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a> = <span class="keyword">new</span> NoeudListePieces(n-&gt;piece);</div>
<div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;        NoeudListePieces* nouveau = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>;</div>
<div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;        NoeudListePieces* courant = n-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;        <span class="keywordflow">while</span>(courant != n)</div>
<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;        {</div>
<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;            nouveau-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a> = <span class="keyword">new</span> NoeudListePieces(courant-&gt;piece);</div>
<div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;            nouveau = nouveau-&gt;suivant;</div>
<div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;            nouveau-&gt;suivant = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>;</div>
<div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;            courant = courant-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;        }</div>
<div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;        nouveau-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a> = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>;</div>
<div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;</div>
<div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;    }<span class="keywordflow">catch</span>(exception&amp;)</div>
<div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;    {</div>
<div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;        <span class="comment">// s&#39;il y a une erreur d&#39;allocation, fait le ménage avant de relancer l&#39;exception</span></div>
<div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;        <a class="code" href="class_t_p1_1_1_labyrinthe.html#a7ca81e2e69b6c14e8ab95ebc93e73b97">_detruire</a>();</div>
<div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;        <span class="keywordflow">throw</span>;</div>
<div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;    }</div>
<div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a7ca81e2e69b6c14e8ab95ebc93e73b97"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a7ca81e2e69b6c14e8ab95ebc93e73b97">TP1::Labyrinthe::_detruire</a></div><div class="ttdeci">void _detruire()</div><div class="ttdoc">Cette méthode détruit proprement le labyrinthe en libérant la mémoire pour chaque noeud...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00365">Labyrinthe.cpp:365</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces_html_a2f88570e73a4af6e882edd199bbb34d2"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">TP1::Labyrinthe::NoeudListePieces::suivant</a></div><div class="ttdeci">NoeudListePieces * suivant</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00147">Labyrinthe.h:147</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8eb7ef93bae46710cbbc6b07db3e9184"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">TP1::Labyrinthe::dernier</a></div><div class="ttdeci">NoeudListePieces * dernier</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00165">Labyrinthe.h:165</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_a32d6b079ac02e24a0cc8f265d00a7259_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_a32d6b079ac02e24a0cc8f265d00a7259_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_a32d6b079ac02e24a0cc8f265d00a7259_cgraph" id="class_t_p1_1_1_labyrinthe_a32d6b079ac02e24a0cc8f265d00a7259_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="a7ca81e2e69b6c14e8ab95ebc93e73b97"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void TP1::Labyrinthe::_detruire </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Cette méthode détruit proprement le labyrinthe en libérant la mémoire pour chaque noeud. </p>
<dl class="section post"><dt>Postcondition</dt><dd>le labyrinthe est proprement détruit </dd></dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00365">365</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8h_source.html#l00169">cpt</a>, <a class="el" href="_labyrinthe_8h_source.html#l00165">dernier</a>, et <a class="el" href="_labyrinthe_8h_source.html#l00147">TP1::Labyrinthe::NoeudListePieces::suivant</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00339">_copier()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00032">~Labyrinthe()</a>.</p>
<div class="fragment"><div class="line"><a name="l00366"></a><span class="lineno">  366</span>&#160;{</div>
<div class="line"><a name="l00367"></a><span class="lineno">  367</span>&#160;    <span class="comment">//s&#39;il y a 0 noeuds, pas besoin de faire rien de spécial, les attributs seront détruit normalement.</span></div>
<div class="line"><a name="l00368"></a><span class="lineno">  368</span>&#160;    <span class="keywordflow">if</span>(<a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a>&gt;0)</div>
<div class="line"><a name="l00369"></a><span class="lineno">  369</span>&#160;    {</div>
<div class="line"><a name="l00370"></a><span class="lineno">  370</span>&#160;        NoeudListePieces* temp = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00371"></a><span class="lineno">  371</span>&#160;        <span class="keywordflow">while</span>(temp != <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>)</div>
<div class="line"><a name="l00372"></a><span class="lineno">  372</span>&#160;        {</div>
<div class="line"><a name="l00373"></a><span class="lineno">  373</span>&#160;            <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a> = temp-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00374"></a><span class="lineno">  374</span>&#160;            temp-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a> = NULL;</div>
<div class="line"><a name="l00375"></a><span class="lineno">  375</span>&#160;            <span class="keyword">delete</span> temp;</div>
<div class="line"><a name="l00376"></a><span class="lineno">  376</span>&#160;            temp = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00377"></a><span class="lineno">  377</span>&#160;        }</div>
<div class="line"><a name="l00378"></a><span class="lineno">  378</span>&#160;        <span class="keyword">delete</span> <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>;</div>
<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;    }</div>
<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;</div>
<div class="line"><a name="l00381"></a><span class="lineno">  381</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ab9727bd08c01a7b8ed33a4523e22a83e"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">TP1::Labyrinthe::cpt</a></div><div class="ttdeci">int cpt</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00169">Labyrinthe.h:169</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces_html_a2f88570e73a4af6e882edd199bbb34d2"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">TP1::Labyrinthe::NoeudListePieces::suivant</a></div><div class="ttdeci">NoeudListePieces * suivant</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00147">Labyrinthe.h:147</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8eb7ef93bae46710cbbc6b07db3e9184"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">TP1::Labyrinthe::dernier</a></div><div class="ttdeci">NoeudListePieces * dernier</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00165">Labyrinthe.h:165</a></div></div>
</div><!-- fragment -->
</div>
</div>
<a class="anchor" id="a7e3d3b3164b40651295d0bc49047fa18"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void TP1::Labyrinthe::_mettreParcourueAFaux </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>mets l'attribut parcourue à faux pour chaque piece dans le labyrinthe </p>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00521">521</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8h_source.html#l00169">cpt</a>, <a class="el" href="_labyrinthe_8h_source.html#l00165">dernier</a>, <a class="el" href="_labyrinthe_8h_source.html#l00145">TP1::Labyrinthe::NoeudListePieces::piece</a>, <a class="el" href="_piece_8cpp_source.html#l00080">TP1::Piece::setParcourue()</a>, et <a class="el" href="_labyrinthe_8h_source.html#l00147">TP1::Labyrinthe::NoeudListePieces::suivant</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00125">cheminLabyrinthe()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00383">solutionner()</a>, et <a class="el" href="_testeur_labyrinthe_s_8cpp_source.html#l00025">TEST()</a>.</p>
<div class="fragment"><div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;{</div>
<div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;    <span class="keywordflow">if</span>(<a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a>&gt;0)</div>
<div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;    {</div>
<div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;        NoeudListePieces * courant = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;        <span class="keywordflow">while</span>(courant!=<a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>)</div>
<div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;        {</div>
<div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;            courant-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a0dfcd04c1cbe96c96568cb4045b1ed4a">piece</a>.<a class="code" href="class_t_p1_1_1_piece.html#a98c3d80561cf8cef97a703c845939af9">setParcourue</a>(<span class="keyword">false</span>);</div>
<div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;            courant = courant-&gt;suivant;</div>
<div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;        }</div>
<div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;        courant-&gt;piece.setParcourue(<span class="keyword">false</span>); <span class="comment">//lorsque courant==dernier, on le fait encore</span></div>
<div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;</div>
<div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;        <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;    }</div>
<div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;</div>
<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ab9727bd08c01a7b8ed33a4523e22a83e"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">TP1::Labyrinthe::cpt</a></div><div class="ttdeci">int cpt</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00169">Labyrinthe.h:169</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces_html_a2f88570e73a4af6e882edd199bbb34d2"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">TP1::Labyrinthe::NoeudListePieces::suivant</a></div><div class="ttdeci">NoeudListePieces * suivant</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00147">Labyrinthe.h:147</a></div></div>
<div class="ttc" id="class_t_p1_1_1_piece_html_a98c3d80561cf8cef97a703c845939af9"><div class="ttname"><a href="class_t_p1_1_1_piece.html#a98c3d80561cf8cef97a703c845939af9">TP1::Piece::setParcourue</a></div><div class="ttdeci">void setParcourue(bool p)</div><div class="ttdoc">Pour initialiser l&#39;attibut parcourue à true ou false. </div><div class="ttdef"><b>Definition:</b> <a href="_piece_8cpp_source.html#l00080">Piece.cpp:80</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8eb7ef93bae46710cbbc6b07db3e9184"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">TP1::Labyrinthe::dernier</a></div><div class="ttdeci">NoeudListePieces * dernier</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00165">Labyrinthe.h:165</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces_html_a0dfcd04c1cbe96c96568cb4045b1ed4a"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a0dfcd04c1cbe96c96568cb4045b1ed4a">TP1::Labyrinthe::NoeudListePieces::piece</a></div><div class="ttdeci">Piece piece</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00145">Labyrinthe.h:145</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_a7e3d3b3164b40651295d0bc49047fa18_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_a7e3d3b3164b40651295d0bc49047fa18_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_a7e3d3b3164b40651295d0bc49047fa18_cgraph" id="class_t_p1_1_1_labyrinthe_a7e3d3b3164b40651295d0bc49047fa18_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="ae0b2183346c7bc6d459fbad723ebef90"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">bool TP1::Labyrinthe::_trouveChemin </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a>&#160;</td>
          <td class="paramname"><em>joueur</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="class_t_p1_1_1_chemin.html">Chemin</a> &amp;&#160;</td>
          <td class="paramname"><em>chemin</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">const <a class="el" href="class_t_p1_1_1_piece.html">Piece</a> &amp;&#160;</td>
          <td class="paramname"><em>derniereAjoute</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Méthode trouvant un chemin pour traverser le labyrinthe pour une couleur donnée. </p>
<dl class="section pre"><dt>Précondition</dt><dd>il y a assez de mémoire pour créer le chemin </dd></dl>
<dl class="section post"><dt>Postcondition</dt><dd>renvoie un chemin valide pour traverser le labyrinthe</dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
  <table class="exception">
    <tr><td class="paramname">bad_alloc</td><td>s'il n'y a pas assez de mémoire</td></tr>
  </table>
  </dd>
</dl>
<dl class="params"><dt>Paramètres</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">joueur,représente</td><td>la couleur du joueur avec lequel on veut traverser le labyrinthe </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">chemin,le</td><td>chemin qu'on construit pour traverser le labyrinthe</td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Renvoie</dt><dd>le chemin construit ou partiellement construit (fonction récursive) </dd></dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00151">151</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8cpp_source.html#l00199">_trouvePiecesAccessible()</a>, <a class="el" href="_chemin_8cpp_source.html#l00077">TP1::Chemin::ajoutePiece()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00167">arrivee</a>, <a class="el" href="_chemin_8cpp_source.html#l00164">TP1::Chemin::getDistanceDernierePiece()</a>, <a class="el" href="_piece_8cpp_source.html#l00070">TP1::Piece::getNom()</a>, <a class="el" href="_chemin_8cpp_source.html#l00144">TP1::Chemin::getNomPiece()</a>, <a class="el" href="_piece_8cpp_source.html#l00090">TP1::Piece::getParcourue()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00145">TP1::Labyrinthe::NoeudListePieces::piece</a>, <a class="el" href="_chemin_8cpp_source.html#l00101">TP1::Chemin::retirePiece()</a>, <a class="el" href="_piece_8cpp_source.html#l00080">TP1::Piece::setParcourue()</a>, <a class="el" href="_chemin_8cpp_source.html#l00134">TP1::Chemin::tailleChemin()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00308">trouvePiece()</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00125">cheminLabyrinthe()</a>.</p>
<div class="fragment"><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;{</div>
<div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;    <span class="comment">// si la dernière pièce ajoutée correspond à la pièce arrivee, on retourne le chemin</span></div>
<div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;    <span class="keywordflow">if</span>(derniereAjoute.getNom() == <a class="code" href="class_t_p1_1_1_labyrinthe.html#ac426bb3a87931bf212c9b3478d7019d1">arrivee</a>-&gt;<a class="code" href="class_t_p1_1_1_piece.html#a413794f80b43ce7178088af478412867">getNom</a>())</div>
<div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;    <span class="keywordflow">else</span></div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;    {</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;        <span class="comment">// on va chercher toutes les pièces accessible à partir de la piece derniereAjoute</span></div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;        Chemin piecesAccessible = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a6c7a9bf56089a18a782553c2c3afa161">_trouvePiecesAccessible</a>(derniereAjoute, joueur);</div>
<div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;</div>
<div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;        <span class="comment">// tant qu&#39;on a des pieces a parcourir</span></div>
<div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;        <span class="keywordflow">while</span>(piecesAccessible.tailleChemin() != 0)</div>
<div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;        {</div>
<div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;            <span class="comment">// trouve la pièce dans le labyrinthe</span></div>
<div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;            <span class="keywordtype">string</span> nom = piecesAccessible.getNomPiece();</div>
<div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;            NoeudListePieces* p = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">trouvePiece</a>(nom);</div>
<div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;            Piece* pieceCourrante = &amp;(p-&gt;piece);</div>
<div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;            <span class="comment">// on retire la piece de la liste des pièces accessible</span></div>
<div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;            piecesAccessible.retirePiece(1);</div>
<div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;            <span class="comment">// si elle n&#39;est pas parcourue, on l&#39;ajoute au chemin et on fait un appel récursif</span></div>
<div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;            <span class="keywordflow">if</span>(!pieceCourrante-&gt;getParcourue())</div>
<div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;            {</div>
<div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;                <span class="keywordtype">int</span> d = chemin.getDistanceDernierePiece();</div>
<div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;                chemin.ajoutePiece(pieceCourrante-&gt;getNom(), d + 1);</div>
<div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;                pieceCourrante-&gt;setParcourue(<span class="keyword">true</span>); <span class="comment">// on marque la piece comme parcourue</span></div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;                <span class="keywordflow">if</span>(<a class="code" href="class_t_p1_1_1_labyrinthe.html#ae0b2183346c7bc6d459fbad723ebef90">_trouveChemin</a>(joueur, chemin, *pieceCourrante))</div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                    <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;                <span class="keywordflow">else</span></div>
<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;                {</div>
<div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;                    <span class="comment">// il n&#39;y a pas de solution à partir de cette pièce, on la retire du chemin</span></div>
<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;                    chemin.retirePiece(chemin.tailleChemin());</div>
<div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;                }</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;            }</div>
<div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;        }</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;        <span class="comment">// on a fait le tour des pièces accessible à partir de la pièce derniereAjoute,</span></div>
<div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;        <span class="comment">// il n&#39;y a pas de solution à partir de cette pièce</span></div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;        <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;    }</div>
<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_piece_html_a413794f80b43ce7178088af478412867"><div class="ttname"><a href="class_t_p1_1_1_piece.html#a413794f80b43ce7178088af478412867">TP1::Piece::getNom</a></div><div class="ttdeci">const std::string &amp; getNom() const </div><div class="ttdoc">renvoi le nom de la pièce </div><div class="ttdef"><b>Definition:</b> <a href="_piece_8cpp_source.html#l00070">Piece.cpp:70</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ae0b2183346c7bc6d459fbad723ebef90"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ae0b2183346c7bc6d459fbad723ebef90">TP1::Labyrinthe::_trouveChemin</a></div><div class="ttdeci">bool _trouveChemin(Couleur, Chemin &amp;, const Piece &amp;)</div><div class="ttdoc">Méthode trouvant un chemin pour traverser le labyrinthe pour une couleur donnée. </div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00151">Labyrinthe.cpp:151</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8085a344fef40a88f2be737080b8b85c"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">TP1::Labyrinthe::trouvePiece</a></div><div class="ttdeci">NoeudListePieces * trouvePiece(std::string &amp;nom) const </div><div class="ttdoc">Méthode retournant l&#39;adresse du noeud de la liste des pièces ayant le nom fourni en argument...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00308">Labyrinthe.cpp:308</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a6c7a9bf56089a18a782553c2c3afa161"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a6c7a9bf56089a18a782553c2c3afa161">TP1::Labyrinthe::_trouvePiecesAccessible</a></div><div class="ttdeci">Chemin _trouvePiecesAccessible(const Piece &amp;, Couleur) const </div><div class="ttdoc">Méthode permettant de trouver toutes les pièces accessibles à partir d&#39;une pièce pour une couleur don...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00199">Labyrinthe.cpp:199</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ac426bb3a87931bf212c9b3478d7019d1"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ac426bb3a87931bf212c9b3478d7019d1">TP1::Labyrinthe::arrivee</a></div><div class="ttdeci">Piece * arrivee</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00167">Labyrinthe.h:167</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_ae0b2183346c7bc6d459fbad723ebef90_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_ae0b2183346c7bc6d459fbad723ebef90_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_ae0b2183346c7bc6d459fbad723ebef90_cgraph" id="class_t_p1_1_1_labyrinthe_ae0b2183346c7bc6d459fbad723ebef90_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="a6c7a9bf56089a18a782553c2c3afa161"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_t_p1_1_1_chemin.html">Chemin</a> TP1::Labyrinthe::_trouvePiecesAccessible </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="class_t_p1_1_1_piece.html">Piece</a> &amp;&#160;</td>
          <td class="paramname"><em>p</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype"><a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a>&#160;</td>
          <td class="paramname"><em>coul</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Méthode permettant de trouver toutes les pièces accessibles à partir d'une pièce pour une couleur donnée. </p>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00199">199</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_chemin_8cpp_source.html#l00077">TP1::Chemin::ajoutePiece()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00165">dernier</a>, <a class="el" href="_liste_portes_8cpp_source.html#l00158">TP1::ListePortes::elementAt()</a>, <a class="el" href="_porte_8cpp_source.html#l00070">TP1::Porte::getCouleur()</a>, <a class="el" href="_porte_8cpp_source.html#l00080">TP1::Porte::getDestination()</a>, <a class="el" href="_piece_8cpp_source.html#l00070">TP1::Piece::getNom()</a>, <a class="el" href="_piece_8cpp_source.html#l00100">TP1::Piece::getPortes()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00145">TP1::Labyrinthe::NoeudListePieces::piece</a>, <a class="el" href="_labyrinthe_8h_source.html#l00147">TP1::Labyrinthe::NoeudListePieces::suivant</a>, et <a class="el" href="_liste_portes_8cpp_source.html#l00028">TP1::ListePortes::tailleListePortes()</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00151">_trouveChemin()</a>.</p>
<div class="fragment"><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;{</div>
<div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;    Chemin piecesAccessible;</div>
<div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;    <span class="comment">// si un porte de p à la couleur coul, on ajoute la destination à piece</span></div>
<div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;    ListePortes portesDe_p = p.getPortes();</div>
<div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; portesDe_p.tailleListePortes(); i++)</div>
<div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;    {</div>
<div class="line"><a name="l00206"></a><span class="lineno">  206</span>&#160;        Porte prte = portesDe_p.elementAt(i + 1);</div>
<div class="line"><a name="l00207"></a><span class="lineno">  207</span>&#160;        <span class="keywordflow">if</span>(prte.getCouleur() == coul)</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;        {</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;            Piece tempPiece = prte.getDestination();</div>
<div class="line"><a name="l00210"></a><span class="lineno">  210</span>&#160;            piecesAccessible.ajoutePiece(tempPiece.getNom(), 0);</div>
<div class="line"><a name="l00211"></a><span class="lineno">  211</span>&#160;        }</div>
<div class="line"><a name="l00212"></a><span class="lineno">  212</span>&#160;    }</div>
<div class="line"><a name="l00213"></a><span class="lineno">  213</span>&#160;    <span class="comment">// on fait une recherche dans toutes les autres pièces pour voir s&#39;il y a des pièces</span></div>
<div class="line"><a name="l00214"></a><span class="lineno">  214</span>&#160;    <span class="comment">// qui ont la pièce p comme destination pour une de leur porte</span></div>
<div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;    NoeudListePieces* temp = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;    <span class="keywordflow">while</span>(temp != <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>)</div>
<div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;    {</div>
<div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;        Piece pieceCourante = temp-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a0dfcd04c1cbe96c96568cb4045b1ed4a">piece</a>;</div>
<div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;        ListePortes portesCourantes = pieceCourante.<a class="code" href="class_t_p1_1_1_piece.html#a0f52ef56da9c4af0cac0ad471aa61932">getPortes</a>();</div>
<div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;        <span class="keywordflow">if</span>(pieceCourante.getNom() != p.getNom())</div>
<div class="line"><a name="l00221"></a><span class="lineno">  221</span>&#160;        {</div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;            <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; portesCourantes.tailleListePortes(); i++)</div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;            {</div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;                Porte prte = portesCourantes.<a class="code" href="class_t_p1_1_1_liste_portes.html#a333ec780cee748e7607e2ebbb8c93bab">elementAt</a>(i + 1);</div>
<div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160;                <span class="comment">// si la destination de la porte prte à le même nom que la piece p et si la couleur</span></div>
<div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160;                <span class="comment">// de prte est coul, on l&#39;ajoute à la pieces</span></div>
<div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;                <span class="keywordflow">if</span>(prte.getDestination().getNom() == p.getNom() &amp;&amp; prte.getCouleur() == coul)</div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;                {</div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;                    piecesAccessible.ajoutePiece(pieceCourante.getNom(), 0);</div>
<div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;                }</div>
<div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;            }</div>
<div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;        }</div>
<div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;</div>
<div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;        temp = temp-&gt;suivant;</div>
<div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;    }</div>
<div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;    Piece pieceCourante = temp-&gt;piece;</div>
<div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;    ListePortes portesCourantes = pieceCourante.getPortes();</div>
<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;    <span class="keywordflow">if</span>(pieceCourante.getNom() != p.getNom())</div>
<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;    {</div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0; i &lt; portesCourantes.tailleListePortes(); i++)</div>
<div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;        {</div>
<div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;            Porte prte = portesCourantes.elementAt(i + 1);</div>
<div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;            <span class="comment">// si la destination de la porte prte à le même nom que la piece p et si la couleur</span></div>
<div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;            <span class="comment">// de prte est coul, on l&#39;ajoute à la pieces</span></div>
<div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;            <span class="keywordflow">if</span>(prte.getDestination().getNom() == p.getNom() &amp;&amp; prte.getCouleur() == coul)</div>
<div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;            {</div>
<div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;                piecesAccessible.ajoutePiece(pieceCourante.getNom(), 0);</div>
<div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;            }</div>
<div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;        }</div>
<div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;    }</div>
<div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;    <span class="keywordflow">return</span> piecesAccessible;</div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces_html_a2f88570e73a4af6e882edd199bbb34d2"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">TP1::Labyrinthe::NoeudListePieces::suivant</a></div><div class="ttdeci">NoeudListePieces * suivant</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00147">Labyrinthe.h:147</a></div></div>
<div class="ttc" id="class_t_p1_1_1_piece_html_a0f52ef56da9c4af0cac0ad471aa61932"><div class="ttname"><a href="class_t_p1_1_1_piece.html#a0f52ef56da9c4af0cac0ad471aa61932">TP1::Piece::getPortes</a></div><div class="ttdeci">const ListePortes &amp; getPortes() const </div><div class="ttdoc">Accéder à la liste des portes qui partent de la pièce. </div><div class="ttdef"><b>Definition:</b> <a href="_piece_8cpp_source.html#l00100">Piece.cpp:100</a></div></div>
<div class="ttc" id="class_t_p1_1_1_liste_portes_html_a333ec780cee748e7607e2ebbb8c93bab"><div class="ttname"><a href="class_t_p1_1_1_liste_portes.html#a333ec780cee748e7607e2ebbb8c93bab">TP1::ListePortes::elementAt</a></div><div class="ttdeci">Porte elementAt(int pos) const </div><div class="ttdoc">retourne l&#39;élément à une position demandée de la liste </div><div class="ttdef"><b>Definition:</b> <a href="_liste_portes_8cpp_source.html#l00158">ListePortes.cpp:158</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8eb7ef93bae46710cbbc6b07db3e9184"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">TP1::Labyrinthe::dernier</a></div><div class="ttdeci">NoeudListePieces * dernier</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00165">Labyrinthe.h:165</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces_html_a0dfcd04c1cbe96c96568cb4045b1ed4a"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a0dfcd04c1cbe96c96568cb4045b1ed4a">TP1::Labyrinthe::NoeudListePieces::piece</a></div><div class="ttdeci">Piece piece</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00145">Labyrinthe.h:145</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_a6c7a9bf56089a18a782553c2c3afa161_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_a6c7a9bf56089a18a782553c2c3afa161_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_a6c7a9bf56089a18a782553c2c3afa161_cgraph" id="class_t_p1_1_1_labyrinthe_a6c7a9bf56089a18a782553c2c3afa161_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="a4b4d2f9b7dc1c3572e720269b9bdad0b"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void TP1::Labyrinthe::ajoutePassage </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a>&#160;</td>
          <td class="paramname"><em>couleur</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">int&#160;</td>
          <td class="paramname"><em>i1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">int&#160;</td>
          <td class="paramname"><em>j1</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">int&#160;</td>
          <td class="paramname"><em>i2</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">int&#160;</td>
          <td class="paramname"><em>j2</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>méthode privée qui ajoute un passage dans un labyrinthe </p>
<dl class="params"><dt>Paramètres</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">Couleur</td><td>couleur Couleur de la porte à ajouter </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">int</td><td>i1 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">int</td><td>j1 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">int</td><td>i2 </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">int</td><td>j2 </td></tr>
  </table>
  </dd>
</dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00688">688</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_piece_8cpp_source.html#l00110">TP1::Piece::ajoutePorte()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00145">TP1::Labyrinthe::NoeudListePieces::piece</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00308">trouvePiece()</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00549">chargeLabyrinthe()</a>.</p>
<div class="fragment"><div class="line"><a name="l00689"></a><span class="lineno">  689</span>&#160;{</div>
<div class="line"><a name="l00690"></a><span class="lineno">  690</span>&#160;</div>
<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;    NoeudListePieces *piece1, *piece2;</div>
<div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;    <span class="keywordtype">string</span> nomPiece1, nomPiece2;</div>
<div class="line"><a name="l00693"></a><span class="lineno">  693</span>&#160;    ostringstream s;</div>
<div class="line"><a name="l00694"></a><span class="lineno">  694</span>&#160;</div>
<div class="line"><a name="l00695"></a><span class="lineno">  695</span>&#160;    s &lt;&lt; i1 &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; j1;</div>
<div class="line"><a name="l00696"></a><span class="lineno">  696</span>&#160;    nomPiece1 = s.str();</div>
<div class="line"><a name="l00697"></a><span class="lineno">  697</span>&#160;</div>
<div class="line"><a name="l00698"></a><span class="lineno">  698</span>&#160;    s.str(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l00699"></a><span class="lineno">  699</span>&#160;</div>
<div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;    s &lt;&lt; i2 &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; j2;</div>
<div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;    nomPiece2 = s.str();</div>
<div class="line"><a name="l00702"></a><span class="lineno">  702</span>&#160;</div>
<div class="line"><a name="l00703"></a><span class="lineno">  703</span>&#160;    s.str(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l00704"></a><span class="lineno">  704</span>&#160;</div>
<div class="line"><a name="l00705"></a><span class="lineno">  705</span>&#160;    piece1 = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">trouvePiece</a>(nomPiece1);</div>
<div class="line"><a name="l00706"></a><span class="lineno">  706</span>&#160;    piece2 = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">trouvePiece</a>(nomPiece2);</div>
<div class="line"><a name="l00707"></a><span class="lineno">  707</span>&#160;</div>
<div class="line"><a name="l00708"></a><span class="lineno">  708</span>&#160;    Porte nouvellePorte(couleur, &amp;(piece2-&gt;piece));</div>
<div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;</div>
<div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;    piece1-&gt;piece.ajoutePorte(nouvellePorte);</div>
<div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8085a344fef40a88f2be737080b8b85c"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">TP1::Labyrinthe::trouvePiece</a></div><div class="ttdeci">NoeudListePieces * trouvePiece(std::string &amp;nom) const </div><div class="ttdoc">Méthode retournant l&#39;adresse du noeud de la liste des pièces ayant le nom fourni en argument...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00308">Labyrinthe.cpp:308</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_a4b4d2f9b7dc1c3572e720269b9bdad0b_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_a4b4d2f9b7dc1c3572e720269b9bdad0b_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_a4b4d2f9b7dc1c3572e720269b9bdad0b_cgraph" id="class_t_p1_1_1_labyrinthe_a4b4d2f9b7dc1c3572e720269b9bdad0b_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="a7297e9340033b8402836ced30e5c96e0"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void TP1::Labyrinthe::ajoutePieceLabyrinthe </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="class_t_p1_1_1_piece.html">Piece</a> &amp;&#160;</td>
          <td class="paramname"><em>p</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Permet d'ajouter une pièce au labyrinthe. </p>
<dl class="section pre"><dt>Précondition</dt><dd>il y a assez de mémoire pour ajouter une pièce </dd></dl>
<dl class="section post"><dt>Postcondition</dt><dd>la nouvelle pièce est dans la liste des pièces</dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
  <table class="exception">
    <tr><td class="paramname">bad_alloc</td><td>s'il n'y a pas assez de mémoire</td></tr>
  </table>
  </dd>
</dl>
<dl class="params"><dt>Paramètres</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">p,référence</td><td>sur la pièce qu'on veut ajouter </td></tr>
  </table>
  </dd>
</dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00079">79</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8h_source.html#l00169">cpt</a>, <a class="el" href="_labyrinthe_8h_source.html#l00165">dernier</a>, <a class="el" href="_piece_8cpp_source.html#l00070">TP1::Piece::getNom()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00145">TP1::Labyrinthe::NoeudListePieces::piece</a>, et <a class="el" href="_labyrinthe_8h_source.html#l00147">TP1::Labyrinthe::NoeudListePieces::suivant</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00549">chargeLabyrinthe()</a>, et <a class="el" href="_testeur_labyrinthe_s_8cpp_source.html#l00032">TEST()</a>.</p>
<div class="fragment"><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;{</div>
<div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;    NoeudListePieces* nouveau = <span class="keyword">new</span> NoeudListePieces(p);</div>
<div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;    nouveau-&gt;suivant = nouveau;</div>
<div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;    NoeudListePieces* courant;</div>
<div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;</div>
<div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;    <span class="comment">// si il n&#39;y a pas de pièce</span></div>
<div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;    <span class="keywordflow">if</span>(<a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a> == 0)</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;    {</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;        <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a> = nouveau;</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;        <a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a>++;</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;        <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;    }</div>
<div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;</div>
<div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;    <span class="comment">// s&#39;il y a déjà des pièces</span></div>
<div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;    <span class="comment">// on vérifie s&#39;il y a une pièce avec le même nom</span></div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;    courant = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;    <span class="keywordflow">while</span>(courant != <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>)</div>
<div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;    {</div>
<div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;        <span class="comment">// s&#39;il y a une pièce avec le même nom, on termine la méthode sans rien faire</span></div>
<div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;        <span class="keywordflow">if</span>(courant-&gt;piece.getNom() == p.getNom())</div>
<div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;        {</div>
<div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;            <span class="keyword">delete</span> nouveau; <span class="comment">// on s&#39;assure de ne pas leaker de la mémoire</span></div>
<div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;            <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;        }</div>
<div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;        courant = courant-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;    }</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;    <span class="keywordflow">if</span>(<a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a0dfcd04c1cbe96c96568cb4045b1ed4a">piece</a>.<a class="code" href="class_t_p1_1_1_piece.html#a413794f80b43ce7178088af478412867">getNom</a>() == p.getNom())</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;    {</div>
<div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;        <span class="keyword">delete</span> nouveau;</div>
<div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;        <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;    }</div>
<div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;    <span class="comment">// on ajoute la nouvelle pièce</span></div>
<div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;    nouveau-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a> = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a> = nouveau;</div>
<div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;    <a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a>++;</div>
<div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;    <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_piece_html_a413794f80b43ce7178088af478412867"><div class="ttname"><a href="class_t_p1_1_1_piece.html#a413794f80b43ce7178088af478412867">TP1::Piece::getNom</a></div><div class="ttdeci">const std::string &amp; getNom() const </div><div class="ttdoc">renvoi le nom de la pièce </div><div class="ttdef"><b>Definition:</b> <a href="_piece_8cpp_source.html#l00070">Piece.cpp:70</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ab9727bd08c01a7b8ed33a4523e22a83e"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">TP1::Labyrinthe::cpt</a></div><div class="ttdeci">int cpt</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00169">Labyrinthe.h:169</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces_html_a2f88570e73a4af6e882edd199bbb34d2"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">TP1::Labyrinthe::NoeudListePieces::suivant</a></div><div class="ttdeci">NoeudListePieces * suivant</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00147">Labyrinthe.h:147</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8eb7ef93bae46710cbbc6b07db3e9184"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">TP1::Labyrinthe::dernier</a></div><div class="ttdeci">NoeudListePieces * dernier</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00165">Labyrinthe.h:165</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces_html_a0dfcd04c1cbe96c96568cb4045b1ed4a"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a0dfcd04c1cbe96c96568cb4045b1ed4a">TP1::Labyrinthe::NoeudListePieces::piece</a></div><div class="ttdeci">Piece piece</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00145">Labyrinthe.h:145</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_a7297e9340033b8402836ced30e5c96e0_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_a7297e9340033b8402836ced30e5c96e0_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_a7297e9340033b8402836ced30e5c96e0_cgraph" id="class_t_p1_1_1_labyrinthe_a7297e9340033b8402836ced30e5c96e0_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="a854dc263c65a447286038fde7843ec41"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">void TP1::Labyrinthe::chargeLabyrinthe </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a>&#160;</td>
          <td class="paramname"><em>couleur</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">std::ifstream &amp;&#160;</td>
          <td class="paramname"><em>entree</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>méthode permettant de charger un fichier contenant un labyrinthe d'une certaine couleur </p>
<dl class="section pre"><dt>Précondition</dt><dd>il y a assez de mémoire pour créer le labyrinthe</dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
  <table class="exception">
    <tr><td class="paramname">bad_alloc</td><td>s'il manque de mémoire</td></tr>
  </table>
  </dd>
</dl>
<dl class="params"><dt>Paramètres</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">couleur,la</td><td>couleur du jouer auquel le labyrinthe chargé s'applique </td></tr>
    <tr><td class="paramdir">[in]</td><td class="paramname">entree,fichier</td><td>contenant la définition du labyrinthe </td></tr>
  </table>
  </dd>
</dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00549">549</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8cpp_source.html#l00688">ajoutePassage()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00079">ajoutePieceLabyrinthe()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00283">placeArrivee()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00260">placeDepart()</a>.</p>

<p>Référencé par <a class="el" href="_principal_8cpp_source.html#l00017">main()</a>, et <a class="el" href="_testeur_labyrinthe_linux_8cpp_source.html#l00015">TEST()</a>.</p>
<div class="fragment"><div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;{</div>
<div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;    <span class="keywordtype">int</span> nbCols, nbRangs;</div>
<div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;</div>
<div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;    entree &gt;&gt; nbCols &gt;&gt; nbRangs;</div>
<div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;    entree.ignore(); <span class="comment">//pour consommer le \n (le caractère fin de ligne)</span></div>
<div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;</div>
<div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;    <span class="keyword">const</span> <span class="keywordtype">int</span> MAX_LIGNE = 1000;</div>
<div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;    <span class="keywordtype">char</span> ligne[MAX_LIGNE];</div>
<div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;</div>
<div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;    entree.getline(ligne, MAX_LIGNE);</div>
<div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;    entree.getline(ligne, MAX_LIGNE);</div>
<div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;</div>
<div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;    std::ostringstream s; <span class="comment">//Une chaîne pour écrire dedans, cette chaîne servira pour nommer les pièces du labyrinthe</span></div>
<div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;</div>
<div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; nbCols; i++)</div>
<div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;    {</div>
<div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; nbRangs; j++)</div>
<div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;        {</div>
<div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;            s &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; j;</div>
<div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;            Piece p(s.str());</div>
<div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;            s.str(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;            <a class="code" href="class_t_p1_1_1_labyrinthe.html#a7297e9340033b8402836ced30e5c96e0">ajoutePieceLabyrinthe</a>(p);</div>
<div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;        }</div>
<div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;    }</div>
<div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;</div>
<div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = 0; i &lt; nbCols; i++)</div>
<div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;    {</div>
<div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;        <span class="keywordflow">if</span> (ligne[i * 4 + 1] == <span class="charliteral">&#39;D&#39;</span> || ligne[i * 4 + 1] == <span class="charliteral">&#39;d&#39;</span>)</div>
<div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;        {</div>
<div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;            std::string nom;</div>
<div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;            s &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;,0&quot;</span>;</div>
<div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;            nom = s.str();</div>
<div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;            s.str(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;            <a class="code" href="class_t_p1_1_1_labyrinthe.html#a4d0e2a073458a8c1aadf99a394f10929">placeDepart</a>(nom);</div>
<div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;        }</div>
<div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;        <span class="keywordflow">if</span> (ligne[i * 4 + 1] == <span class="charliteral">&#39;F&#39;</span> || ligne[i * 4 + 1] == <span class="charliteral">&#39;f&#39;</span> || ligne[i * 4</div>
<div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;                + 1] == <span class="charliteral">&#39;A&#39;</span> || ligne[i * 4 + 1] == <span class="charliteral">&#39;a&#39;</span>)</div>
<div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;        {</div>
<div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;            std::string nom;</div>
<div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;            s &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;,0&quot;</span>;</div>
<div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;            nom = s.str();</div>
<div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;            s.str(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;            <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8cfe9f921d848b474e1843d1779753d7">placeArrivee</a>(nom);</div>
<div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;        }</div>
<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;    }</div>
<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;</div>
<div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;    <span class="keywordflow">for</span> (<span class="keywordtype">int</span> j = 0; j &lt; nbRangs; j++)</div>
<div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;    {</div>
<div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;        entree.getline(ligne, MAX_LIGNE);</div>
<div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;</div>
<div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;        <span class="keywordflow">for</span> (<span class="keywordtype">int</span> i = (j == nbRangs - 1 &amp;&amp; (j &amp; 1)) ? 1 : 0; i &lt; nbCols; i++)</div>
<div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;        {</div>
<div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;            <span class="keywordflow">if</span> (j &amp; 1)</div>
<div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;            {</div>
<div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;                <span class="keywordflow">if</span> (j &lt; nbRangs - 2 &amp;&amp; ligne[i * 4 + 3] == <span class="charliteral">&#39; &#39;</span>)</div>
<div class="line"><a name="l00605"></a><span class="lineno">  605</span>&#160;                {</div>
<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;                    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a4b4d2f9b7dc1c3572e720269b9bdad0b">ajoutePassage</a>(couleur, i, j, i, j + 2);</div>
<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;                }</div>
<div class="line"><a name="l00608"></a><span class="lineno">  608</span>&#160;                <span class="keywordflow">if</span> (j &lt; nbRangs - 1 &amp;&amp; ligne[i * 4 + 2] == <span class="charliteral">&#39; &#39;</span>)</div>
<div class="line"><a name="l00609"></a><span class="lineno">  609</span>&#160;                {</div>
<div class="line"><a name="l00610"></a><span class="lineno">  610</span>&#160;                    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a4b4d2f9b7dc1c3572e720269b9bdad0b">ajoutePassage</a>(couleur, i, j, i, j + 1);</div>
<div class="line"><a name="l00611"></a><span class="lineno">  611</span>&#160;                }</div>
<div class="line"><a name="l00612"></a><span class="lineno">  612</span>&#160;                <span class="keywordflow">if</span> (j &lt; nbRangs - 1 &amp;&amp; ligne[i * 4 + 0] == <span class="charliteral">&#39; &#39;</span>)</div>
<div class="line"><a name="l00613"></a><span class="lineno">  613</span>&#160;                {</div>
<div class="line"><a name="l00614"></a><span class="lineno">  614</span>&#160;                    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a4b4d2f9b7dc1c3572e720269b9bdad0b">ajoutePassage</a>(couleur, i - 1, j, i, j + 1);</div>
<div class="line"><a name="l00615"></a><span class="lineno">  615</span>&#160;                }</div>
<div class="line"><a name="l00616"></a><span class="lineno">  616</span>&#160;                <span class="keywordflow">if</span> (j &lt; nbRangs - 1 &amp;&amp; (ligne[i * 4 + 1] == <span class="charliteral">&#39;D&#39;</span> || ligne[i * 4</div>
<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;                        + 1] == <span class="charliteral">&#39;d&#39;</span>))</div>
<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;                {</div>
<div class="line"><a name="l00619"></a><span class="lineno">  619</span>&#160;                    std::string nom;</div>
<div class="line"><a name="l00620"></a><span class="lineno">  620</span>&#160;                    s &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; j + 1;</div>
<div class="line"><a name="l00621"></a><span class="lineno">  621</span>&#160;                    nom = s.str();</div>
<div class="line"><a name="l00622"></a><span class="lineno">  622</span>&#160;                    s.str(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l00623"></a><span class="lineno">  623</span>&#160;                    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a4d0e2a073458a8c1aadf99a394f10929">placeDepart</a>(nom);</div>
<div class="line"><a name="l00624"></a><span class="lineno">  624</span>&#160;                }</div>
<div class="line"><a name="l00625"></a><span class="lineno">  625</span>&#160;                <span class="keywordflow">if</span> (j &lt; nbRangs - 1 &amp;&amp; (ligne[i * 4 + 1] == <span class="charliteral">&#39;F&#39;</span> || ligne[i * 4</div>
<div class="line"><a name="l00626"></a><span class="lineno">  626</span>&#160;                        + 1] == <span class="charliteral">&#39;f&#39;</span> || ligne[i * 4 + 1] == <span class="charliteral">&#39;A&#39;</span> || ligne[i * 4</div>
<div class="line"><a name="l00627"></a><span class="lineno">  627</span>&#160;                        + 1] == <span class="charliteral">&#39;a&#39;</span>))</div>
<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;                {</div>
<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;                    std::string nom;</div>
<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;                    s &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; j + 1;</div>
<div class="line"><a name="l00631"></a><span class="lineno">  631</span>&#160;                    nom = s.str();</div>
<div class="line"><a name="l00632"></a><span class="lineno">  632</span>&#160;                    s.str(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l00633"></a><span class="lineno">  633</span>&#160;                    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8cfe9f921d848b474e1843d1779753d7">placeArrivee</a>(nom);</div>
<div class="line"><a name="l00634"></a><span class="lineno">  634</span>&#160;                }</div>
<div class="line"><a name="l00635"></a><span class="lineno">  635</span>&#160;            }</div>
<div class="line"><a name="l00636"></a><span class="lineno">  636</span>&#160;            <span class="keywordflow">else</span></div>
<div class="line"><a name="l00637"></a><span class="lineno">  637</span>&#160;            {</div>
<div class="line"><a name="l00638"></a><span class="lineno">  638</span>&#160;                <span class="keywordflow">if</span> (j &lt; nbRangs - 1 &amp;&amp; ligne[i * 4 + 0] == <span class="charliteral">&#39; &#39;</span>)</div>
<div class="line"><a name="l00639"></a><span class="lineno">  639</span>&#160;                {</div>
<div class="line"><a name="l00640"></a><span class="lineno">  640</span>&#160;                    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a4b4d2f9b7dc1c3572e720269b9bdad0b">ajoutePassage</a>(couleur, i - 1, j + 1, i, j);</div>
<div class="line"><a name="l00641"></a><span class="lineno">  641</span>&#160;                }</div>
<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;                <span class="keywordflow">if</span> (j &lt; nbRangs - 2 &amp;&amp; ligne[i * 4 + 1] == <span class="charliteral">&#39; &#39;</span>)</div>
<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;                {</div>
<div class="line"><a name="l00644"></a><span class="lineno">  644</span>&#160;                    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a4b4d2f9b7dc1c3572e720269b9bdad0b">ajoutePassage</a>(couleur, i, j, i, j + 2);</div>
<div class="line"><a name="l00645"></a><span class="lineno">  645</span>&#160;                }</div>
<div class="line"><a name="l00646"></a><span class="lineno">  646</span>&#160;                <span class="keywordflow">if</span> (j &lt; nbRangs - 1 &amp;&amp; ligne[i * 4 + 2] == <span class="charliteral">&#39; &#39;</span>)</div>
<div class="line"><a name="l00647"></a><span class="lineno">  647</span>&#160;                {</div>
<div class="line"><a name="l00648"></a><span class="lineno">  648</span>&#160;                    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a4b4d2f9b7dc1c3572e720269b9bdad0b">ajoutePassage</a>(couleur, i, j, i, j + 1);</div>
<div class="line"><a name="l00649"></a><span class="lineno">  649</span>&#160;                }</div>
<div class="line"><a name="l00650"></a><span class="lineno">  650</span>&#160;                <span class="keywordflow">if</span> (j &lt; nbRangs - 1 &amp;&amp; (ligne[i * 4 + 3] == <span class="charliteral">&#39;D&#39;</span> || ligne[i * 4</div>
<div class="line"><a name="l00651"></a><span class="lineno">  651</span>&#160;                        + 3] == <span class="charliteral">&#39;d&#39;</span>))</div>
<div class="line"><a name="l00652"></a><span class="lineno">  652</span>&#160;                {</div>
<div class="line"><a name="l00653"></a><span class="lineno">  653</span>&#160;                    std::string nom;</div>
<div class="line"><a name="l00654"></a><span class="lineno">  654</span>&#160;                    s &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; j + 1;</div>
<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;                    nom = s.str();</div>
<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;                    s.str(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;                    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a4d0e2a073458a8c1aadf99a394f10929">placeDepart</a>(nom);</div>
<div class="line"><a name="l00658"></a><span class="lineno">  658</span>&#160;                }</div>
<div class="line"><a name="l00659"></a><span class="lineno">  659</span>&#160;                <span class="keywordflow">if</span> (j &lt; nbRangs - 1 &amp;&amp; (ligne[i * 4 + 3] == <span class="charliteral">&#39;F&#39;</span> || ligne[i * 4</div>
<div class="line"><a name="l00660"></a><span class="lineno">  660</span>&#160;                        + 3] == <span class="charliteral">&#39;f&#39;</span> || ligne[i * 4 + 3] == <span class="charliteral">&#39;A&#39;</span> || ligne[i * 4</div>
<div class="line"><a name="l00661"></a><span class="lineno">  661</span>&#160;                        + 3] == <span class="charliteral">&#39;a&#39;</span>))</div>
<div class="line"><a name="l00662"></a><span class="lineno">  662</span>&#160;                {</div>
<div class="line"><a name="l00663"></a><span class="lineno">  663</span>&#160;                    std::string nom;</div>
<div class="line"><a name="l00664"></a><span class="lineno">  664</span>&#160;                    s &lt;&lt; i &lt;&lt; <span class="stringliteral">&quot;,&quot;</span> &lt;&lt; j + 1;</div>
<div class="line"><a name="l00665"></a><span class="lineno">  665</span>&#160;                    nom = s.str();</div>
<div class="line"><a name="l00666"></a><span class="lineno">  666</span>&#160;                    s.str(<span class="stringliteral">&quot;&quot;</span>);</div>
<div class="line"><a name="l00667"></a><span class="lineno">  667</span>&#160;                    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8cfe9f921d848b474e1843d1779753d7">placeArrivee</a>(nom);</div>
<div class="line"><a name="l00668"></a><span class="lineno">  668</span>&#160;                }</div>
<div class="line"><a name="l00669"></a><span class="lineno">  669</span>&#160;            }</div>
<div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;        }</div>
<div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;    }</div>
<div class="line"><a name="l00672"></a><span class="lineno">  672</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a4d0e2a073458a8c1aadf99a394f10929"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a4d0e2a073458a8c1aadf99a394f10929">TP1::Labyrinthe::placeDepart</a></div><div class="ttdeci">void placeDepart(std::string &amp;nom)</div><div class="ttdoc">Méthode qui ajuste le pointeur depart pour qu&#39;il pointe sur la pièce qui à le nom passé en argument...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00260">Labyrinthe.cpp:260</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a7297e9340033b8402836ced30e5c96e0"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a7297e9340033b8402836ced30e5c96e0">TP1::Labyrinthe::ajoutePieceLabyrinthe</a></div><div class="ttdeci">void ajoutePieceLabyrinthe(Piece &amp;p)</div><div class="ttdoc">Permet d&#39;ajouter une pièce au labyrinthe. </div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00079">Labyrinthe.cpp:79</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8cfe9f921d848b474e1843d1779753d7"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8cfe9f921d848b474e1843d1779753d7">TP1::Labyrinthe::placeArrivee</a></div><div class="ttdeci">void placeArrivee(std::string &amp;nom)</div><div class="ttdoc">Méthode qui ajuste le pointeur arrivee pour qu&#39;il pointe sur la pièce qui à le nom passé en argument...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00283">Labyrinthe.cpp:283</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a4b4d2f9b7dc1c3572e720269b9bdad0b"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a4b4d2f9b7dc1c3572e720269b9bdad0b">TP1::Labyrinthe::ajoutePassage</a></div><div class="ttdeci">void ajoutePassage(Couleur couleur, int i1, int j1, int i2, int j2)</div><div class="ttdoc">méthode privée qui ajoute un passage dans un labyrinthe </div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00688">Labyrinthe.cpp:688</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_a854dc263c65a447286038fde7843ec41_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_a854dc263c65a447286038fde7843ec41_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_a854dc263c65a447286038fde7843ec41_cgraph" id="class_t_p1_1_1_labyrinthe_a854dc263c65a447286038fde7843ec41_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="ac6e2db78398a84ccf495e318df7643d0"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_t_p1_1_1_chemin.html">Chemin</a> TP1::Labyrinthe::cheminLabyrinthe </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a>&#160;</td>
          <td class="paramname"><em>joueur</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Méthode permettant de trouver un chemin pour solutionner le labyrinthe pour une couleur donnée. </p>
<dl class="section pre"><dt>Précondition</dt><dd>il y a assez de mémoire pour créer un nouveau chemin </dd></dl>
<dl class="section post"><dt>Postcondition</dt><dd>le chemin contiendra les pièces dans le bonne ordre pour résoudre le labyrinthe (du départ jusqu'à l'arrivée)</dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
  <table class="exception">
    <tr><td class="paramname">bad_alloc</td><td>s'il n'y a pas assez de mémoire</td></tr>
  </table>
  </dd>
</dl>
<dl class="params"><dt>Paramètres</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">joueur,représente</td><td>la couleur du joueur avec lequel on veut traverser le labyrinthe</td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Renvoie</dt><dd>un chemin qui correspond au chemin le plus court pour traverser le labyrinthe pour cette couleur </dd></dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00125">125</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8cpp_source.html#l00521">_mettreParcourueAFaux()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00151">_trouveChemin()</a>, <a class="el" href="_chemin_8cpp_source.html#l00077">TP1::Chemin::ajoutePiece()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00167">depart</a>, <a class="el" href="_piece_8cpp_source.html#l00070">TP1::Piece::getNom()</a>, et <a class="el" href="_piece_8cpp_source.html#l00080">TP1::Piece::setParcourue()</a>.</p>

<p>Référencé par <a class="el" href="_principal_8cpp_source.html#l00017">main()</a>, et <a class="el" href="_testeur_labyrinthe_linux_8cpp_source.html#l00015">TEST()</a>.</p>
<div class="fragment"><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;{</div>
<div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a7e3d3b3164b40651295d0bc49047fa18">_mettreParcourueAFaux</a>(); <span class="comment">//initialise les valeurs de parcourue pour tous les pièces à faux.</span></div>
<div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;    <span class="comment">// chemin qui va construire la solution</span></div>
<div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;    Chemin solution;</div>
<div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;    solution.ajoutePiece(<a class="code" href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">depart</a>-&gt;<a class="code" href="class_t_p1_1_1_piece.html#a413794f80b43ce7178088af478412867">getNom</a>(),0);</div>
<div class="line"><a name="l00131"></a><span class="lineno">  131</span>&#160;    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">depart</a>-&gt;<a class="code" href="class_t_p1_1_1_piece.html#a98c3d80561cf8cef97a703c845939af9">setParcourue</a>(<span class="keyword">true</span>);</div>
<div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160;    <span class="comment">// méthode privée qui trouve la solution de manière récursive</span></div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;    <span class="keywordflow">if</span>(<a class="code" href="class_t_p1_1_1_labyrinthe.html#ae0b2183346c7bc6d459fbad723ebef90">_trouveChemin</a>(joueur, solution, *<a class="code" href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">depart</a>))</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;        <span class="keywordflow">return</span> solution;</div>
<div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160;    <span class="keywordflow">else</span></div>
<div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;    {</div>
<div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;        Chemin pasDeSolution;</div>
<div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;        <span class="keywordflow">return</span> pasDeSolution;</div>
<div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;    }</div>
<div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;</div>
<div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_piece_html_a413794f80b43ce7178088af478412867"><div class="ttname"><a href="class_t_p1_1_1_piece.html#a413794f80b43ce7178088af478412867">TP1::Piece::getNom</a></div><div class="ttdeci">const std::string &amp; getNom() const </div><div class="ttdoc">renvoi le nom de la pièce </div><div class="ttdef"><b>Definition:</b> <a href="_piece_8cpp_source.html#l00070">Piece.cpp:70</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a41c30a4b682aa2846674740f9ae011ee"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">TP1::Labyrinthe::depart</a></div><div class="ttdeci">Piece * depart</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00167">Labyrinthe.h:167</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ae0b2183346c7bc6d459fbad723ebef90"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ae0b2183346c7bc6d459fbad723ebef90">TP1::Labyrinthe::_trouveChemin</a></div><div class="ttdeci">bool _trouveChemin(Couleur, Chemin &amp;, const Piece &amp;)</div><div class="ttdoc">Méthode trouvant un chemin pour traverser le labyrinthe pour une couleur donnée. </div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00151">Labyrinthe.cpp:151</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a7e3d3b3164b40651295d0bc49047fa18"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a7e3d3b3164b40651295d0bc49047fa18">TP1::Labyrinthe::_mettreParcourueAFaux</a></div><div class="ttdeci">void _mettreParcourueAFaux()</div><div class="ttdoc">mets l&#39;attribut parcourue à faux pour chaque piece dans le labyrinthe </div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00521">Labyrinthe.cpp:521</a></div></div>
<div class="ttc" id="class_t_p1_1_1_piece_html_a98c3d80561cf8cef97a703c845939af9"><div class="ttname"><a href="class_t_p1_1_1_piece.html#a98c3d80561cf8cef97a703c845939af9">TP1::Piece::setParcourue</a></div><div class="ttdeci">void setParcourue(bool p)</div><div class="ttdoc">Pour initialiser l&#39;attibut parcourue à true ou false. </div><div class="ttdef"><b>Definition:</b> <a href="_piece_8cpp_source.html#l00080">Piece.cpp:80</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_ac6e2db78398a84ccf495e318df7643d0_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_ac6e2db78398a84ccf495e318df7643d0_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_ac6e2db78398a84ccf495e318df7643d0_cgraph" id="class_t_p1_1_1_labyrinthe_ac6e2db78398a84ccf495e318df7643d0_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="a1ad0c84b6d7f383a9d65d397d38bcb56"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">const <a class="el" href="class_t_p1_1_1_labyrinthe.html">Labyrinthe</a> &amp; TP1::Labyrinthe::operator= </td>
          <td>(</td>
          <td class="paramtype">const <a class="el" href="class_t_p1_1_1_labyrinthe.html">Labyrinthe</a> &amp;&#160;</td>
          <td class="paramname"><em>source</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>surcharge de l'opérateur d'assignation, fait une copie profonde du labyrinthe passé en argument dans l'objet courant </p>
<dl class="section pre"><dt>Précondition</dt><dd>il y a assez de mémoire pour faire la copie</dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
  <table class="exception">
    <tr><td class="paramname">bad_alloc</td><td>s'il n'y a pas assez de mémoire </td></tr>
  </table>
  </dd>
</dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00056">56</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8cpp_source.html#l00339">_copier()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00167">arrivee</a>, <a class="el" href="_labyrinthe_8h_source.html#l00169">cpt</a>, <a class="el" href="_labyrinthe_8h_source.html#l00167">depart</a>, <a class="el" href="_labyrinthe_8h_source.html#l00165">dernier</a>, <a class="el" href="_piece_8cpp_source.html#l00070">TP1::Piece::getNom()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00283">placeArrivee()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00260">placeDepart()</a>.</p>
<div class="fragment"><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;{</div>
<div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;    <span class="keywordflow">if</span>(&amp;source != <span class="keyword">this</span>)</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;    {</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;        <a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a> = source.cpt;</div>
<div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a> != 0)</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;        {</div>
<div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;            <a class="code" href="class_t_p1_1_1_labyrinthe.html#a32d6b079ac02e24a0cc8f265d00a7259">_copier</a>(source.dernier);</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;            <span class="keywordtype">string</span> nom = source.arrivee-&gt;getNom();</div>
<div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;            <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8cfe9f921d848b474e1843d1779753d7">placeArrivee</a>(nom);</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;            nom = source.depart-&gt;getNom();</div>
<div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;            <a class="code" href="class_t_p1_1_1_labyrinthe.html#a4d0e2a073458a8c1aadf99a394f10929">placeDepart</a>(nom);</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;        }</div>
<div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;</div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;    }</div>
<div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a4d0e2a073458a8c1aadf99a394f10929"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a4d0e2a073458a8c1aadf99a394f10929">TP1::Labyrinthe::placeDepart</a></div><div class="ttdeci">void placeDepart(std::string &amp;nom)</div><div class="ttdoc">Méthode qui ajuste le pointeur depart pour qu&#39;il pointe sur la pièce qui à le nom passé en argument...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00260">Labyrinthe.cpp:260</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ab9727bd08c01a7b8ed33a4523e22a83e"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">TP1::Labyrinthe::cpt</a></div><div class="ttdeci">int cpt</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00169">Labyrinthe.h:169</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8cfe9f921d848b474e1843d1779753d7"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8cfe9f921d848b474e1843d1779753d7">TP1::Labyrinthe::placeArrivee</a></div><div class="ttdeci">void placeArrivee(std::string &amp;nom)</div><div class="ttdoc">Méthode qui ajuste le pointeur arrivee pour qu&#39;il pointe sur la pièce qui à le nom passé en argument...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00283">Labyrinthe.cpp:283</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a32d6b079ac02e24a0cc8f265d00a7259"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a32d6b079ac02e24a0cc8f265d00a7259">TP1::Labyrinthe::_copier</a></div><div class="ttdeci">void _copier(NoeudListePieces *)</div><div class="ttdoc">fait une copie d&#39;un labyrinthe à partir du noeud fourni en argument </div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00339">Labyrinthe.cpp:339</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_a1ad0c84b6d7f383a9d65d397d38bcb56_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_a1ad0c84b6d7f383a9d65d397d38bcb56_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_a1ad0c84b6d7f383a9d65d397d38bcb56_cgraph" id="class_t_p1_1_1_labyrinthe_a1ad0c84b6d7f383a9d65d397d38bcb56_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="a8cfe9f921d848b474e1843d1779753d7"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void TP1::Labyrinthe::placeArrivee </td>
          <td>(</td>
          <td class="paramtype">std::string &amp;&#160;</td>
          <td class="paramname"><em>nom</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Méthode qui ajuste le pointeur arrivee pour qu'il pointe sur la pièce qui à le nom passé en argument. </p>
<dl class="section pre"><dt>Précondition</dt><dd>la pièce fait partie du labyrinthe </dd></dl>
<dl class="section post"><dt>Postcondition</dt><dd>le pointeur pointe sur la bonne pièce</dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
  <table class="exception">
    <tr><td class="paramname">logic_error</td><td>si le labyrinthe ne contient pas de pièce ayant le nom fourni en argument</td></tr>
  </table>
  </dd>
</dl>
<dl class="params"><dt>Paramètres</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">nom,représente</td><td>le nom de la pièce d'arrivée du labyrinthe </td></tr>
  </table>
  </dd>
</dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00283">283</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8h_source.html#l00167">arrivee</a>, <a class="el" href="_labyrinthe_8h_source.html#l00169">cpt</a>, <a class="el" href="_labyrinthe_8h_source.html#l00145">TP1::Labyrinthe::NoeudListePieces::piece</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00308">trouvePiece()</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00549">chargeLabyrinthe()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00042">Labyrinthe()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00056">operator=()</a>.</p>
<div class="fragment"><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;{</div>
<div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;    <span class="comment">// si le labyrinthe n&#39;a pas de pièce, on lance une exception</span></div>
<div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;    <span class="keywordflow">if</span>(<a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a> == 0)</div>
<div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;        <span class="keywordflow">throw</span> logic_error(<span class="stringliteral">&quot;placeArrivee: Le labyrinthe ne contient pas de pièce.&quot;</span>);</div>
<div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;</div>
<div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;    NoeudListePieces* courant;</div>
<div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;    <span class="keywordflow">try</span></div>
<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;    {</div>
<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;        courant = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">trouvePiece</a>(nom);</div>
<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;    }</div>
<div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;    <span class="keywordflow">catch</span> (logic_error&amp; e)</div>
<div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;    {</div>
<div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;        <span class="keywordflow">throw</span> logic_error(<span class="stringliteral">&quot;placeArrivee: Le labyrinthe ne contient pas de pièce ayant le nom donné.&quot;</span>);</div>
<div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;    }</div>
<div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;    <a class="code" href="class_t_p1_1_1_labyrinthe.html#ac426bb3a87931bf212c9b3478d7019d1">arrivee</a> = &amp;(courant-&gt;piece);</div>
<div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ab9727bd08c01a7b8ed33a4523e22a83e"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">TP1::Labyrinthe::cpt</a></div><div class="ttdeci">int cpt</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00169">Labyrinthe.h:169</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8085a344fef40a88f2be737080b8b85c"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">TP1::Labyrinthe::trouvePiece</a></div><div class="ttdeci">NoeudListePieces * trouvePiece(std::string &amp;nom) const </div><div class="ttdoc">Méthode retournant l&#39;adresse du noeud de la liste des pièces ayant le nom fourni en argument...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00308">Labyrinthe.cpp:308</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ac426bb3a87931bf212c9b3478d7019d1"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ac426bb3a87931bf212c9b3478d7019d1">TP1::Labyrinthe::arrivee</a></div><div class="ttdeci">Piece * arrivee</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00167">Labyrinthe.h:167</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_a8cfe9f921d848b474e1843d1779753d7_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_a8cfe9f921d848b474e1843d1779753d7_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_a8cfe9f921d848b474e1843d1779753d7_cgraph" id="class_t_p1_1_1_labyrinthe_a8cfe9f921d848b474e1843d1779753d7_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="a4d0e2a073458a8c1aadf99a394f10929"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">void TP1::Labyrinthe::placeDepart </td>
          <td>(</td>
          <td class="paramtype">std::string &amp;&#160;</td>
          <td class="paramname"><em>nom</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Méthode qui ajuste le pointeur depart pour qu'il pointe sur la pièce qui à le nom passé en argument. </p>
<dl class="section pre"><dt>Précondition</dt><dd>la pièce fait partie du labyrinthe </dd></dl>
<dl class="section post"><dt>Postcondition</dt><dd>le pointeur pointe sur la bonne pièce</dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
  <table class="exception">
    <tr><td class="paramname">logic_error</td><td>si le labyrinthe ne contient pas de pièce ayant le nom fourni en argument</td></tr>
  </table>
  </dd>
</dl>
<dl class="params"><dt>Paramètres</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">nom,représente</td><td>le nom de la pièce de départ du labyrinthe </td></tr>
  </table>
  </dd>
</dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00260">260</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8h_source.html#l00169">cpt</a>, <a class="el" href="_labyrinthe_8h_source.html#l00167">depart</a>, <a class="el" href="_labyrinthe_8h_source.html#l00145">TP1::Labyrinthe::NoeudListePieces::piece</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00308">trouvePiece()</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00549">chargeLabyrinthe()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00042">Labyrinthe()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00056">operator=()</a>.</p>
<div class="fragment"><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;{</div>
<div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;    <span class="comment">// si le labyrinthe n&#39;a pas de pièce, on lance une exception</span></div>
<div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;    <span class="keywordflow">if</span>(<a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a> == 0)</div>
<div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;        <span class="keywordflow">throw</span> logic_error(<span class="stringliteral">&quot;placeDepart: Le labyrinthe ne contient pas de pièce.&quot;</span>);</div>
<div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;</div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;    NoeudListePieces* courant;</div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;    <span class="keywordflow">try</span></div>
<div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;    {</div>
<div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;        courant = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">trouvePiece</a>(nom);</div>
<div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;    }</div>
<div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;    <span class="keywordflow">catch</span> (logic_error&amp; e)</div>
<div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;    {</div>
<div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;        <span class="keywordflow">throw</span> logic_error(<span class="stringliteral">&quot;placeDepart: Le labyrinthe ne contient pas de pièce ayant le nom donné.&quot;</span>);</div>
<div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160;    }</div>
<div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">depart</a> = &amp;(courant-&gt;piece);</div>
<div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a41c30a4b682aa2846674740f9ae011ee"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">TP1::Labyrinthe::depart</a></div><div class="ttdeci">Piece * depart</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00167">Labyrinthe.h:167</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ab9727bd08c01a7b8ed33a4523e22a83e"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">TP1::Labyrinthe::cpt</a></div><div class="ttdeci">int cpt</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00169">Labyrinthe.h:169</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8085a344fef40a88f2be737080b8b85c"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">TP1::Labyrinthe::trouvePiece</a></div><div class="ttdeci">NoeudListePieces * trouvePiece(std::string &amp;nom) const </div><div class="ttdoc">Méthode retournant l&#39;adresse du noeud de la liste des pièces ayant le nom fourni en argument...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00308">Labyrinthe.cpp:308</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_a4d0e2a073458a8c1aadf99a394f10929_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_a4d0e2a073458a8c1aadf99a394f10929_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_a4d0e2a073458a8c1aadf99a394f10929_cgraph" id="class_t_p1_1_1_labyrinthe_a4d0e2a073458a8c1aadf99a394f10929_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="aaf2181692e1946ce3c42242acb34bcbe"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname">int TP1::Labyrinthe::solutionner </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a>&#160;</td>
          <td class="paramname"><em>joueur</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>trouve le nombre d'étapes minimales à franchir pour partir de la case départ et arriver à la case arrivée pour un joueur </p>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00383">383</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8cpp_source.html#l00521">_mettreParcourueAFaux()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00167">arrivee</a>, <a class="el" href="_file_pieces_8cpp_source.html#l00065">TP1::FilePieces::defilePiece()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00167">depart</a>, <a class="el" href="_labyrinthe_8h_source.html#l00165">dernier</a>, <a class="el" href="_liste_portes_8cpp_source.html#l00158">TP1::ListePortes::elementAt()</a>, <a class="el" href="_file_pieces_8cpp_source.html#l00054">TP1::FilePieces::enfilePiece()</a>, <a class="el" href="_file_pieces_8cpp_source.html#l00087">TP1::FilePieces::estVideFile()</a>, <a class="el" href="_porte_8cpp_source.html#l00070">TP1::Porte::getCouleur()</a>, <a class="el" href="_porte_8cpp_source.html#l00080">TP1::Porte::getDestination()</a>, <a class="el" href="_piece_8cpp_source.html#l00070">TP1::Piece::getNom()</a>, <a class="el" href="_piece_8cpp_source.html#l00090">TP1::Piece::getParcourue()</a>, <a class="el" href="_piece_8cpp_source.html#l00100">TP1::Piece::getPortes()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00145">TP1::Labyrinthe::NoeudListePieces::piece</a>, <a class="el" href="_piece_8cpp_source.html#l00080">TP1::Piece::setParcourue()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00147">TP1::Labyrinthe::NoeudListePieces::suivant</a>, <a class="el" href="_liste_portes_8cpp_source.html#l00028">TP1::ListePortes::tailleListePortes()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00308">trouvePiece()</a>.</p>

<p>Référencé par <a class="el" href="_principal_8cpp_source.html#l00017">main()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00464">trouveGagnant()</a>.</p>
<div class="fragment"><div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;{</div>
<div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;    <span class="comment">//mettre parcourue à FAUX pour toutes les pièces</span></div>
<div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;    <a class="code" href="class_t_p1_1_1_labyrinthe.html#a7e3d3b3164b40651295d0bc49047fa18">_mettreParcourueAFaux</a>();</div>
<div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;</div>
<div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;    FilePieces file;        <span class="comment">//filePieces pour tenir les pièces qu&#39;on enfilera/défilera</span></div>
<div class="line"><a name="l00389"></a><span class="lineno">  389</span>&#160;    <span class="keywordtype">int</span> distanceDuDebut=0;</div>
<div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160;</div>
<div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160;</div>
<div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160;    <span class="comment">//enfiler la piece de depart &quot;P1&quot; avec distanceDuDebut == 0</span></div>
<div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160;    file.enfilePiece(<a class="code" href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">depart</a>-&gt;<a class="code" href="class_t_p1_1_1_piece.html#a413794f80b43ce7178088af478412867">getNom</a>(),distanceDuDebut);</div>
<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;</div>
<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;</div>
<div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;    <span class="comment">//pendant que (il reste des pièces dans la file &amp;&amp; la piece d&#39;arrivée n&#39;est pas atteinte)</span></div>
<div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;    <span class="keywordflow">while</span>(file.estVideFile() == <span class="keyword">false</span>)</div>
<div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;    {</div>
<div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;        <span class="comment">//tiendra le nom de la piece</span></div>
<div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;        std::string nomDePiece;</div>
<div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;</div>
<div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;        <span class="comment">//defiler une piece &quot;pcDefile&quot;</span></div>
<div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;        file.defilePiece(nomDePiece,distanceDuDebut);</div>
<div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;        <span class="comment">//on trouve la pièce dans la liste chainee de pieces</span></div>
<div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;        NoeudListePieces * pcDefile = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">trouvePiece</a>(nomDePiece);</div>
<div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;        <span class="comment">//lorsqu&#39;on défile, la pièce est parcourue et on ne peut plus y retourner</span></div>
<div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;        pcDefile-&gt;piece.setParcourue(<span class="keyword">true</span>);</div>
<div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;</div>
<div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;        <span class="comment">//si la piece défilé est la piece d&#39;arrivée, on a fini</span></div>
<div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;        <span class="keywordflow">if</span>(pcDefile-&gt;piece.getNom()==<a class="code" href="class_t_p1_1_1_labyrinthe.html#ac426bb3a87931bf212c9b3478d7019d1">arrivee</a>-&gt;<a class="code" href="class_t_p1_1_1_piece.html#a413794f80b43ce7178088af478412867">getNom</a>())</div>
<div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;        {</div>
<div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;            <span class="keywordflow">return</span> distanceDuDebut;</div>
<div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;        }</div>
<div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;</div>
<div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;        <span class="comment">//si la pièce n&#39;était pas la pièce d&#39;arrivée, on enchaine tous les autres pièces non-parcourues qui ont une porte avec cette pièce</span></div>
<div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;        <span class="comment">//1.  les pièces avec une porte de cette pièce vers l&#39;autre</span></div>
<div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;        <span class="comment">//for(chaque porte qui sort de la pièce)</span></div>
<div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0 ; i &lt; pcDefile-&gt;piece.getPortes().tailleListePortes() ; i++)</div>
<div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;        {</div>
<div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;            <span class="comment">//si la porte est de la même couleur que le joueur ET que la piece où qu&#39;elle mêne n&#39;est pas parcourue,</span></div>
<div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;            Porte porteTemp = pcDefile-&gt;piece.getPortes().elementAt(i+1);</div>
<div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;            <span class="keywordflow">if</span>(porteTemp.getCouleur() == joueur &amp;&amp; porteTemp.getDestination().getParcourue()==<span class="keyword">false</span>)</div>
<div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;            {</div>
<div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;                <span class="comment">//On enfile la pièce</span></div>
<div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;                file.enfilePiece(porteTemp.getDestination().getNom(), distanceDuDebut+1);</div>
<div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;            }</div>
<div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;</div>
<div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;        }</div>
<div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;</div>
<div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;</div>
<div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;        <span class="comment">//2.  VERIFIER TOUS LES PIECES DU LABYRINTHE: SI UNE PIECE A UNE PORTE QUI MENENT VERS CETTE PIECE, C&#39;EST EQUIVALENT A L&#39;ÉTAPE PRÉCÉDENTE</span></div>
<div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;        <span class="comment">//for(chaque piece dans le labyrinthe)</span></div>
<div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;        NoeudListePieces * element = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>;</div>
<div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;        <span class="keywordflow">do</span></div>
<div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;        {</div>
<div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;            <span class="comment">//vérifier si la piece du noeud courant est parcourue.  Si oui, on ne fait rien.</span></div>
<div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;            <span class="keywordflow">if</span>(element-&gt;piece.getParcourue()==<span class="keyword">false</span>)</div>
<div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;            {</div>
<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;            <span class="comment">//Sinon (C&#39;est à dire, si la pièce n&#39;est pas déjà parcourue):</span></div>
<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;                <span class="comment">//On parcours sa liste de porte</span></div>
<div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 0 ; i &lt; element-&gt;piece.getPortes().tailleListePortes() ; i++)</div>
<div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;                {</div>
<div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;                    Porte porteTemp = element-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a0dfcd04c1cbe96c96568cb4045b1ed4a">piece</a>.<a class="code" href="class_t_p1_1_1_piece.html#a0f52ef56da9c4af0cac0ad471aa61932">getPortes</a>().<a class="code" href="class_t_p1_1_1_liste_portes.html#a333ec780cee748e7607e2ebbb8c93bab">elementAt</a>(i+1);</div>
<div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;                    <span class="comment">//Est-ce que la porte est de ma couleur **ET** est-ce que la porte mène à la pièce où je suis présentement?</span></div>
<div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;                    <span class="keywordflow">if</span>(porteTemp.getCouleur() == joueur &amp;&amp; porteTemp.getDestination().getNom() == pcDefile-&gt;piece.getNom())</div>
<div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;                    {</div>
<div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;                        <span class="comment">//Si oui, on enfile la piece.  Si non, rien.</span></div>
<div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;                        file.enfilePiece(element-&gt;piece.getNom(),distanceDuDebut+1);</div>
<div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;                    }</div>
<div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;                }</div>
<div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;            }</div>
<div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;            element = element-&gt;suivant;</div>
<div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;        }</div>
<div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;        <span class="keywordflow">while</span>(element!=<a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>);</div>
<div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;    }</div>
<div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;</div>
<div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;    <span class="keywordflow">if</span> (file.estVideFile()==<span class="keyword">true</span>)</div>
<div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;    {</div>
<div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;        distanceDuDebut = -1;</div>
<div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;    }</div>
<div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;    <span class="keywordflow">return</span> distanceDuDebut;</div>
<div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_piece_html_a413794f80b43ce7178088af478412867"><div class="ttname"><a href="class_t_p1_1_1_piece.html#a413794f80b43ce7178088af478412867">TP1::Piece::getNom</a></div><div class="ttdeci">const std::string &amp; getNom() const </div><div class="ttdoc">renvoi le nom de la pièce </div><div class="ttdef"><b>Definition:</b> <a href="_piece_8cpp_source.html#l00070">Piece.cpp:70</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a41c30a4b682aa2846674740f9ae011ee"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a41c30a4b682aa2846674740f9ae011ee">TP1::Labyrinthe::depart</a></div><div class="ttdeci">Piece * depart</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00167">Labyrinthe.h:167</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8085a344fef40a88f2be737080b8b85c"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8085a344fef40a88f2be737080b8b85c">TP1::Labyrinthe::trouvePiece</a></div><div class="ttdeci">NoeudListePieces * trouvePiece(std::string &amp;nom) const </div><div class="ttdoc">Méthode retournant l&#39;adresse du noeud de la liste des pièces ayant le nom fourni en argument...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00308">Labyrinthe.cpp:308</a></div></div>
<div class="ttc" id="class_t_p1_1_1_piece_html_a0f52ef56da9c4af0cac0ad471aa61932"><div class="ttname"><a href="class_t_p1_1_1_piece.html#a0f52ef56da9c4af0cac0ad471aa61932">TP1::Piece::getPortes</a></div><div class="ttdeci">const ListePortes &amp; getPortes() const </div><div class="ttdoc">Accéder à la liste des portes qui partent de la pièce. </div><div class="ttdef"><b>Definition:</b> <a href="_piece_8cpp_source.html#l00100">Piece.cpp:100</a></div></div>
<div class="ttc" id="class_t_p1_1_1_liste_portes_html_a333ec780cee748e7607e2ebbb8c93bab"><div class="ttname"><a href="class_t_p1_1_1_liste_portes.html#a333ec780cee748e7607e2ebbb8c93bab">TP1::ListePortes::elementAt</a></div><div class="ttdeci">Porte elementAt(int pos) const </div><div class="ttdoc">retourne l&#39;élément à une position demandée de la liste </div><div class="ttdef"><b>Definition:</b> <a href="_liste_portes_8cpp_source.html#l00158">ListePortes.cpp:158</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a7e3d3b3164b40651295d0bc49047fa18"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a7e3d3b3164b40651295d0bc49047fa18">TP1::Labyrinthe::_mettreParcourueAFaux</a></div><div class="ttdeci">void _mettreParcourueAFaux()</div><div class="ttdoc">mets l&#39;attribut parcourue à faux pour chaque piece dans le labyrinthe </div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00521">Labyrinthe.cpp:521</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ac426bb3a87931bf212c9b3478d7019d1"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ac426bb3a87931bf212c9b3478d7019d1">TP1::Labyrinthe::arrivee</a></div><div class="ttdeci">Piece * arrivee</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00167">Labyrinthe.h:167</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8eb7ef93bae46710cbbc6b07db3e9184"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">TP1::Labyrinthe::dernier</a></div><div class="ttdeci">NoeudListePieces * dernier</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00165">Labyrinthe.h:165</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces_html_a0dfcd04c1cbe96c96568cb4045b1ed4a"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a0dfcd04c1cbe96c96568cb4045b1ed4a">TP1::Labyrinthe::NoeudListePieces::piece</a></div><div class="ttdeci">Piece piece</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00145">Labyrinthe.h:145</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_aaf2181692e1946ce3c42242acb34bcbe_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_aaf2181692e1946ce3c42242acb34bcbe_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_aaf2181692e1946ce3c42242acb34bcbe_cgraph" id="class_t_p1_1_1_labyrinthe_aaf2181692e1946ce3c42242acb34bcbe_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="a0c496d235d32655572107f1ea18b8978"></a>
<div class="memitem">
<div class="memproto">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690e">Couleur</a> TP1::Labyrinthe::trouveGagnant </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
</div><div class="memdoc">

<p>Méthode permettant de trouver la couleur qui résout le labyrinthe le plus rapidement. </p>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00464">464</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_porte_8h_source.html#l00025">TP1::Aucun</a>, <a class="el" href="_porte_8h_source.html#l00025">TP1::Bleu</a>, <a class="el" href="_porte_8h_source.html#l00025">TP1::Jaune</a>, <a class="el" href="_porte_8h_source.html#l00025">TP1::Rouge</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00383">solutionner()</a>, et <a class="el" href="_porte_8h_source.html#l00025">TP1::Vert</a>.</p>

<p>Référencé par <a class="el" href="_principal_8cpp_source.html#l00017">main()</a>.</p>
<div class="fragment"><div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;{</div>
<div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;    <span class="keywordtype">int</span> solutionRouge, solutionVert, solutionBleu, solutionJaune;</div>
<div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;    solutionRouge = <a class="code" href="class_t_p1_1_1_labyrinthe.html#aaf2181692e1946ce3c42242acb34bcbe">solutionner</a>(<a class="code" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690ea595da0cd6755470faa7557f03b500a63">Rouge</a>);</div>
<div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;    solutionVert = <a class="code" href="class_t_p1_1_1_labyrinthe.html#aaf2181692e1946ce3c42242acb34bcbe">solutionner</a>(<a class="code" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690eabe0ea9860158ec92d69b0950c9a77a20">Vert</a>);</div>
<div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;    solutionBleu = <a class="code" href="class_t_p1_1_1_labyrinthe.html#aaf2181692e1946ce3c42242acb34bcbe">solutionner</a>(<a class="code" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690eaee026ef535817b182f6343fd5f39f3f0">Bleu</a>);</div>
<div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;    solutionJaune = <a class="code" href="class_t_p1_1_1_labyrinthe.html#aaf2181692e1946ce3c42242acb34bcbe">solutionner</a>(<a class="code" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690ea17294929f25c6255c90ba75bc66aad18">Jaune</a>);</div>
<div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;    <span class="keywordflow">if</span>(solutionRouge==solutionVert &amp;&amp; solutionVert==solutionBleu &amp;&amp; solutionBleu==solutionJaune &amp;&amp; solutionJaune==-1)</div>
<div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;    {</div>
<div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690eae0bf5933ca3585058577def6ab4ceec7">Aucun</a>;</div>
<div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;    }</div>
<div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;    <span class="comment">//créer un tableau avec les solutions</span></div>
<div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;    <span class="keywordtype">int</span> solutionnaire[4];</div>
<div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;    solutionnaire[0] = solutionRouge;</div>
<div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;    solutionnaire[1] = solutionVert;</div>
<div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;    solutionnaire[2] = solutionBleu;</div>
<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;    solutionnaire[3] = solutionJaune;</div>
<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;    <span class="comment">//trouver le minimum</span></div>
<div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;    <span class="comment">//stocker la premiere valeur dans une variable minimumSolution</span></div>
<div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;    <span class="keywordtype">int</span> minimumSolution=-1;</div>
<div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;    <span class="comment">//for chaque élément du vecteur</span></div>
<div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;    <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = 0; j&lt;4 ; j++)</div>
<div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;    {</div>
<div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;        <span class="comment">//if element&lt;minimumSolution</span></div>
<div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;        <span class="keywordflow">if</span>(solutionnaire[j]&gt;0 &amp;&amp; (solutionnaire[j]&lt;minimumSolution || minimumSolution==-1))</div>
<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;        {</div>
<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;            <span class="comment">//minimumSolution=element</span></div>
<div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;            minimumSolution=solutionnaire[j];</div>
<div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;        }</div>
<div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;    }</div>
<div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;</div>
<div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;    <span class="comment">//vérifier quel couleur == minimumSolution</span></div>
<div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;    <span class="comment">//ordre de priorité des couleurs:  Rouge, Vert, Bleu, Jaune</span></div>
<div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;    <span class="keywordflow">if</span>(solutionRouge == minimumSolution)</div>
<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;    {</div>
<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690ea595da0cd6755470faa7557f03b500a63">Rouge</a>;</div>
<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;    }</div>
<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;    <span class="keywordflow">else</span> <span class="keywordflow">if</span> (solutionVert == minimumSolution)</div>
<div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;    {</div>
<div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690eabe0ea9860158ec92d69b0950c9a77a20">Vert</a>;</div>
<div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;    }</div>
<div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;    <span class="keywordflow">else</span> <span class="keywordflow">if</span> (solutionBleu == minimumSolution)</div>
<div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;    {</div>
<div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690eaee026ef535817b182f6343fd5f39f3f0">Bleu</a>;</div>
<div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;    }</div>
<div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;    <span class="keywordflow">else</span> <span class="keywordflow">if</span> (solutionJaune == minimumSolution)</div>
<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;    {</div>
<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690ea17294929f25c6255c90ba75bc66aad18">Jaune</a>;</div>
<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;    }</div>
<div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;    <span class="keywordflow">return</span> <a class="code" href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690eae0bf5933ca3585058577def6ab4ceec7">Aucun</a>;   <span class="comment">//return Aucun si erreur... mais ne devrait pas se rendre içi</span></div>
<div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;}</div>
<div class="ttc" id="namespace_t_p1_html_a8b5ef3e0301394a6503b5b11ab59690ea595da0cd6755470faa7557f03b500a63"><div class="ttname"><a href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690ea595da0cd6755470faa7557f03b500a63">TP1::Rouge</a></div><div class="ttdef"><b>Definition:</b> <a href="_porte_8h_source.html#l00025">Porte.h:25</a></div></div>
<div class="ttc" id="namespace_t_p1_html_a8b5ef3e0301394a6503b5b11ab59690eaee026ef535817b182f6343fd5f39f3f0"><div class="ttname"><a href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690eaee026ef535817b182f6343fd5f39f3f0">TP1::Bleu</a></div><div class="ttdef"><b>Definition:</b> <a href="_porte_8h_source.html#l00025">Porte.h:25</a></div></div>
<div class="ttc" id="namespace_t_p1_html_a8b5ef3e0301394a6503b5b11ab59690ea17294929f25c6255c90ba75bc66aad18"><div class="ttname"><a href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690ea17294929f25c6255c90ba75bc66aad18">TP1::Jaune</a></div><div class="ttdef"><b>Definition:</b> <a href="_porte_8h_source.html#l00025">Porte.h:25</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_aaf2181692e1946ce3c42242acb34bcbe"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#aaf2181692e1946ce3c42242acb34bcbe">TP1::Labyrinthe::solutionner</a></div><div class="ttdeci">int solutionner(Couleur joueur)</div><div class="ttdoc">trouve le nombre d&#39;étapes minimales à franchir pour partir de la case départ et arriver à la case arr...</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8cpp_source.html#l00383">Labyrinthe.cpp:383</a></div></div>
<div class="ttc" id="namespace_t_p1_html_a8b5ef3e0301394a6503b5b11ab59690eae0bf5933ca3585058577def6ab4ceec7"><div class="ttname"><a href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690eae0bf5933ca3585058577def6ab4ceec7">TP1::Aucun</a></div><div class="ttdef"><b>Definition:</b> <a href="_porte_8h_source.html#l00025">Porte.h:25</a></div></div>
<div class="ttc" id="namespace_t_p1_html_a8b5ef3e0301394a6503b5b11ab59690eabe0ea9860158ec92d69b0950c9a77a20"><div class="ttname"><a href="namespace_t_p1.html#a8b5ef3e0301394a6503b5b11ab59690eabe0ea9860158ec92d69b0950c9a77a20">TP1::Vert</a></div><div class="ttdef"><b>Definition:</b> <a href="_porte_8h_source.html#l00025">Porte.h:25</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_a0c496d235d32655572107f1ea18b8978_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_a0c496d235d32655572107f1ea18b8978_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_a0c496d235d32655572107f1ea18b8978_cgraph" id="class_t_p1_1_1_labyrinthe_a0c496d235d32655572107f1ea18b8978_cgraph">
</map>
</div>
</p>

</div>
</div>
<a class="anchor" id="a8085a344fef40a88f2be737080b8b85c"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html">Labyrinthe::NoeudListePieces</a> * TP1::Labyrinthe::trouvePiece </td>
          <td>(</td>
          <td class="paramtype">std::string &amp;&#160;</td>
          <td class="paramname"><em>nom</em></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Méthode retournant l'adresse du noeud de la liste des pièces ayant le nom fourni en argument. </p>
<dl class="section pre"><dt>Précondition</dt><dd>la pièce fait parti du labyrinthe </dd></dl>
<dl class="section post"><dt>Postcondition</dt><dd>la bonne adresse sera renvoyé</dd></dl>
<dl class="exception"><dt>Exceptions</dt><dd>
  <table class="exception">
    <tr><td class="paramname">logic_error</td><td>si aucune pièce à le nom fourni en argument</td></tr>
  </table>
  </dd>
</dl>
<dl class="params"><dt>Paramètres</dt><dd>
  <table class="params">
    <tr><td class="paramdir">[in]</td><td class="paramname">nom,nom</td><td>de la pièce que la méthode doit trouver</td></tr>
  </table>
  </dd>
</dl>
<dl class="section return"><dt>Renvoie</dt><dd>L'adresse du noeud qui contient la pièce avec le nom donné </dd></dl>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8cpp_source.html#l00308">308</a> du fichier <a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a>.</p>

<p>Références <a class="el" href="_labyrinthe_8h_source.html#l00169">cpt</a>, <a class="el" href="_labyrinthe_8h_source.html#l00165">dernier</a>, <a class="el" href="_piece_8cpp_source.html#l00070">TP1::Piece::getNom()</a>, <a class="el" href="_labyrinthe_8h_source.html#l00145">TP1::Labyrinthe::NoeudListePieces::piece</a>, et <a class="el" href="_labyrinthe_8h_source.html#l00147">TP1::Labyrinthe::NoeudListePieces::suivant</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00151">_trouveChemin()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00688">ajoutePassage()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00283">placeArrivee()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00260">placeDepart()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00383">solutionner()</a>.</p>
<div class="fragment"><div class="line"><a name="l00309"></a><span class="lineno">  309</span>&#160;{</div>
<div class="line"><a name="l00310"></a><span class="lineno">  310</span>&#160;    <span class="comment">// si le labyrinthe n&#39;a pas de pièce, on lance une exception</span></div>
<div class="line"><a name="l00311"></a><span class="lineno">  311</span>&#160;    <span class="keywordflow">if</span>(<a class="code" href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">cpt</a> == 0)</div>
<div class="line"><a name="l00312"></a><span class="lineno">  312</span>&#160;        <span class="keywordflow">throw</span> logic_error(<span class="stringliteral">&quot;trouvePiece: Le labyrinthe ne contient pas de pièce.&quot;</span>);</div>
<div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;</div>
<div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;    NoeudListePieces* courant;</div>
<div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;    courant = <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;    <span class="keywordflow">while</span>(courant != <a class="code" href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">dernier</a>)</div>
<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;    {</div>
<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;        <span class="keywordflow">if</span>(courant-&gt;piece.getNom() == nom)</div>
<div class="line"><a name="l00319"></a><span class="lineno">  319</span>&#160;        {</div>
<div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160;            <span class="keywordflow">return</span> courant;</div>
<div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;        }</div>
<div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160;        courant = courant-&gt;<a class="code" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">suivant</a>;</div>
<div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160;    }</div>
<div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160;    <span class="comment">// on vérifie si la dernière pièce à le nom donné</span></div>
<div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;    <span class="keywordflow">if</span>(courant-&gt;piece.getNom() == nom)</div>
<div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;    {</div>
<div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;        <span class="keywordflow">return</span> courant;</div>
<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;    }</div>
<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;    <span class="comment">// aucune pièce dans le labyrinthe a le nom donné</span></div>
<div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;    <span class="keywordflow">else</span></div>
<div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;        <span class="keywordflow">throw</span> logic_error(<span class="stringliteral">&quot;trouvePiece: Le labyrinthe ne contient pas de pièce ayant le nom donné.&quot;</span>);</div>
<div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;}</div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_ab9727bd08c01a7b8ed33a4523e22a83e"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#ab9727bd08c01a7b8ed33a4523e22a83e">TP1::Labyrinthe::cpt</a></div><div class="ttdeci">int cpt</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00169">Labyrinthe.h:169</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces_html_a2f88570e73a4af6e882edd199bbb34d2"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html#a2f88570e73a4af6e882edd199bbb34d2">TP1::Labyrinthe::NoeudListePieces::suivant</a></div><div class="ttdeci">NoeudListePieces * suivant</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00147">Labyrinthe.h:147</a></div></div>
<div class="ttc" id="class_t_p1_1_1_labyrinthe_html_a8eb7ef93bae46710cbbc6b07db3e9184"><div class="ttname"><a href="class_t_p1_1_1_labyrinthe.html#a8eb7ef93bae46710cbbc6b07db3e9184">TP1::Labyrinthe::dernier</a></div><div class="ttdeci">NoeudListePieces * dernier</div><div class="ttdef"><b>Definition:</b> <a href="_labyrinthe_8h_source.html#l00165">Labyrinthe.h:165</a></div></div>
</div><!-- fragment -->
<p><div class="dynheader">
Voici le graphe d'appel pour cette fonction :</div>
<div class="dyncontent">
<div class="center"><img src="class_t_p1_1_1_labyrinthe_a8085a344fef40a88f2be737080b8b85c_cgraph.png" border="0" usemap="#class_t_p1_1_1_labyrinthe_a8085a344fef40a88f2be737080b8b85c_cgraph" alt=""/></div>
<map name="class_t_p1_1_1_labyrinthe_a8085a344fef40a88f2be737080b8b85c_cgraph" id="class_t_p1_1_1_labyrinthe_a8085a344fef40a88f2be737080b8b85c_cgraph">
</map>
</div>
</p>

</div>
</div>
<h2 class="groupheader">Documentation des données membres</h2>
<a class="anchor" id="ac426bb3a87931bf212c9b3478d7019d1"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_t_p1_1_1_piece.html">Piece</a> * TP1::Labyrinthe::arrivee</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>Adresses des pièces de départ et d'arrivée </p>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8h_source.html#l00167">167</a> du fichier <a class="el" href="_labyrinthe_8h_source.html">Labyrinthe.h</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00151">_trouveChemin()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00042">Labyrinthe()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00056">operator=()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00283">placeArrivee()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00383">solutionner()</a>.</p>

</div>
</div>
<a class="anchor" id="ab9727bd08c01a7b8ed33a4523e22a83e"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">int TP1::Labyrinthe::cpt</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>va contenir le nombre de pièce dans le labyrinthe </p>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8h_source.html#l00169">169</a> du fichier <a class="el" href="_labyrinthe_8h_source.html">Labyrinthe.h</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00365">_detruire()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00521">_mettreParcourueAFaux()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00079">ajoutePieceLabyrinthe()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00042">Labyrinthe()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00056">operator=()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00283">placeArrivee()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00260">placeDepart()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00308">trouvePiece()</a>.</p>

</div>
</div>
<a class="anchor" id="a41c30a4b682aa2846674740f9ae011ee"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_t_p1_1_1_piece.html">Piece</a>* TP1::Labyrinthe::depart</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Définition à la ligne <a class="el" href="_labyrinthe_8h_source.html#l00167">167</a> du fichier <a class="el" href="_labyrinthe_8h_source.html">Labyrinthe.h</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00125">cheminLabyrinthe()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00042">Labyrinthe()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00056">operator=()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00260">placeDepart()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00383">solutionner()</a>.</p>

</div>
</div>
<a class="anchor" id="a8eb7ef93bae46710cbbc6b07db3e9184"></a>
<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="class_t_p1_1_1_labyrinthe_1_1_noeud_liste_pieces.html">NoeudListePieces</a>* TP1::Labyrinthe::dernier</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">private</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">
<p>pointeur sur le dernier noeud de la liste circulaire </p>

<p>Définition à la ligne <a class="el" href="_labyrinthe_8h_source.html#l00165">165</a> du fichier <a class="el" href="_labyrinthe_8h_source.html">Labyrinthe.h</a>.</p>

<p>Référencé par <a class="el" href="_labyrinthe_8cpp_source.html#l00339">_copier()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00365">_detruire()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00521">_mettreParcourueAFaux()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00199">_trouvePiecesAccessible()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00079">ajoutePieceLabyrinthe()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00042">Labyrinthe()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00056">operator=()</a>, <a class="el" href="_labyrinthe_8cpp_source.html#l00383">solutionner()</a>, et <a class="el" href="_labyrinthe_8cpp_source.html#l00308">trouvePiece()</a>.</p>

</div>
</div>
<hr/>La documentation de cette classe a été générée à partir des fichiers suivants :<ul>
<li><a class="el" href="_labyrinthe_8h_source.html">Labyrinthe.h</a></li>
<li><a class="el" href="_labyrinthe_8cpp_source.html">Labyrinthe.cpp</a></li>
</ul>
</div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
  <ul>
    <li class="navelem"><a class="el" href="namespace_t_p1.html">TP1</a></li><li class="navelem"><a class="el" href="class_t_p1_1_1_labyrinthe.html">Labyrinthe</a></li>
    <li class="footer">Généré le Dimanche 8 Juin 2014 19:37:06 pour TP1-Algo par
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.6 </li>
  </ul>
</div>
</body>
</html>
